Recognised as Number
4,734,139
- Positive
- Odd
- Prime
- 7 digits
4,734,139 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,734,139
Digit count7
Digit sum31
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,734,139
Distinct prime factors14,734,139
Number of divisors2
Sum of divisors σ(n)4,734,140
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,734,138integers below n that share no factor with it
Carmichael function λ(n)4,734,138the 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,734,1392 in total
Arithmetic
Previous number4,734,138
Next number4,734,140
Double9,468,278
Half2,367,069.5
Square22,412,072,071,321
Cube106,101,864,463,651,527,619
Square root2,175.807666132≈irrational, shown to 9 decimal places
Cube root167.911458919≈
Negation-4,734,139
Reciprocal2.11231652 × 10^-7≈
Representations
Decimal4,734,139
Binary1001000001111001011101123 bits
Octal22036273
Hexadecimal483CBB
Base 362TGVV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and thirty-four thousand, one hundred and thirty-nine
Ordinalfour million, seven hundred and thirty-four thousand, one hundred and thirty-ninth
Scientific notation4.734139 × 10^6
Engineering notation4.734139 × 10^6
In other bases
Ternary22220112000111base 3; the most digit-efficient integer base after e: 14 digits
Quinary2202443024base 5; one hand: 10 digits
Septenary55145104base 7: 8 digits
Nonary8815014base 9; each digit is two ternary digits: 7 digits
Duodecimal17037b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19bf6jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:55:2:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000T1TTT000111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000100110111001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010000011110010111011
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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 3c bb
Gray code11011000010001011100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010000011110010111011
64-bit0000000000000000000000000000000000000000010010000011110010111011
One's complement11111111101101111100001101000100at 32 bits, every bit flipped
Bits reversed11011101001111000001001000000000at 32 bits
Rotated left by 100000000100100000111100101110110at 32 bits, wrapping
Shifted left by 1100100000111100101110110= 9,468,278, no wrap
Shifted right by 11001000001111001011101= 2,367,069, discarding the low bit
These bits as a double2.33897544 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,734,139 to the power 222,412,072,071,321
4,734,139 to the power 3106,101,864,463,651,527,619
4,734,139 to the power 4502,300,974,530,086,779,310,685,041
4,734,139 to the power 52,377,962,633,260,890,495,319,107,169,314,699
First ten multiples4,734,139, 9,468,278, 14,202,417, 18,936,556, 23,670,695, 28,404,834, 33,138,973, 37,873,112, 42,607,251, 47,341,390
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1224the total stopping time
Highest value reached34,124,3087× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,734,139 → 14,202,418 → 7,101,209 → 21,303,628 → 10,651,814 → 5,325,907 → 15,977,722 → 7,988,861 → 23,966,584 → 11,983,292 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage473,413,900%
4,734,139% as a decimal47,341.39
4,734,139% of 1004,734,139
4,734,139% of 1,00047,341,390
As a fraction of 1004,734,139/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,734,139
Nerdulate something else
Nothing in mind? Surprise me · today’s page