Recognised as Number
4,739,443
- Positive
- Odd
- Prime
- 7 digits
4,739,443 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,739,443
Digit count7
Digit sum34
Digit product36,288
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,739,443
Distinct prime factors14,739,443
Number of divisors2
Sum of divisors σ(n)4,739,444
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,739,442integers below n that share no factor with it
Carmichael function λ(n)4,739,442the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,739,4432 in total
Arithmetic
Previous number4,739,442
Next number4,739,444
Double9,478,886
Half2,369,721.5
Square22,462,319,950,249
Cube106,458,885,051,967,971,307
Square root2,177.026182663≈irrational, shown to 9 decimal places
Cube root167.974143318≈
Negation-4,739,443
Reciprocal2.10995258 × 10^-7≈
Representations
Decimal4,739,443
Binary1001000010100010111001123 bits
Octal22050563
Hexadecimal485173
Base 362TKZ7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and thirty-nine thousand, four hundred and forty-three
Ordinalfour million, seven hundred and thirty-nine thousand, four hundred and forty-third
Scientific notation4.739443 × 10^6
Engineering notation4.739443 × 10^6
In other bases
Ternary22220210021221base 3; the most digit-efficient integer base after e: 14 digits
Quinary2203130233base 5; one hand: 10 digits
Septenary55166422base 7: 8 digits
Nonary8823257base 9; each digit is two ternary digits: 7 digits
Duodecimal1706897base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19c8c3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:56:30:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000T1T1010T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000101011010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010000101000101110011
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes348 51 73
Gray code11011000111100111001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010000101000101110011
64-bit0000000000000000000000000000000000000000010010000101000101110011
One's complement11111111101101111010111010001100at 32 bits, every bit flipped
Bits reversed11001110100010100001001000000000at 32 bits
Rotated left by 100000000100100001010001011100110at 32 bits, wrapping
Shifted left by 1100100001010001011100110= 9,478,886, no wrap
Shifted right by 11001000010100010111001= 2,369,721, discarding the low bit
These bits as a double2.34159597 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,739,443 to the power 222,462,319,950,249
4,739,443 to the power 3106,458,885,051,967,971,307
4,739,443 to the power 4504,555,817,547,354,237,835,162,001
4,739,443 to the power 52,391,313,537,584,085,211,028,193,699,505,443
First ten multiples4,739,443, 9,478,886, 14,218,329, 18,957,772, 23,697,215, 28,436,658, 33,176,101, 37,915,544, 42,654,987, 47,394,430
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1162the total stopping time
Highest value reached21,327,4964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,739,443 → 14,218,330 → 7,109,165 → 21,327,496 → 10,663,748 → 5,331,874 → 2,665,937 → 7,997,812 → 3,998,906 → 1,999,453 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage473,944,300%
4,739,443% as a decimal47,394.43
4,739,443% of 1004,739,443
4,739,443% of 1,00047,394,430
As a fraction of 1004,739,443/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 4,739,443
Nerdulate something else
Nothing in mind? Surprise me · today’s page