Recognised as Number
1,234,367
- Positive
- Odd
- Prime
- 7 digits
1,234,367 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,234,367
Digit count7
Digit sum26
Digit product3,024
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,234,367
Distinct prime factors11,234,367
Number of divisors2
Sum of divisors σ(n)1,234,368
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,234,366integers below n that share no factor with it
Carmichael function λ(n)1,234,366the 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, 1,234,3672 in total
Arithmetic
Previous number1,234,366
Next number1,234,368
Double2,468,734
Half617,183.5
Square1,523,661,890,689
Cube1,880,757,957,024,108,863
Square root1,111.020701877≈irrational, shown to 9 decimal places
Cube root107.270778934≈
Negation-1,234,367
Reciprocal8.10131833 × 10^-7≈
Representations
Decimal1,234,367
Binary10010110101011011111121 bits
Octal4552677
Hexadecimal12D5BF
Base 36QGFZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and thirty-four thousand, three hundred and sixty-seven
Ordinalone million, two hundred and thirty-four thousand, three hundred and sixty-seventh
Scientific notation1.234367 × 10^6
Engineering notation1.234367 × 10^6
In other bases
Ternary2022201020022base 3; the most digit-efficient integer base after e: 13 digits
Quinary303444432base 5; one hand: 9 digits
Septenary13330511base 7: 8 digits
Nonary2281208base 9; each digit is two ternary digits: 7 digits
Duodecimal4b63bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7e5i7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:42:52:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T011T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110010101011000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100101101010110111111
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes312 d5 bf
Gray code110111011111101100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100101101010110111111
64-bit0000000000000000000000000000000000000000000100101101010110111111
One's complement11111111111011010010101001000000at 32 bits, every bit flipped
Bits reversed11111101101010110100100000000000at 32 bits
Rotated left by 100000000001001011010101101111110at 32 bits, wrapping
Shifted left by 11001011010101101111110= 2,468,734, no wrap
Shifted right by 110010110101011011111= 617,183, discarding the low bit
These bits as a double6.09858329 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,234,367 to the power 21,523,661,890,689
1,234,367 to the power 31,880,757,957,024,108,863
1,234,367 to the power 42,321,545,557,137,978,184,894,721
1,234,367 to the power 52,865,639,224,727,734,718,153,942,076,607
First ten multiples1,234,367, 2,468,734, 3,703,101, 4,937,468, 6,171,835, 7,406,202, 8,640,569, 9,874,936, 11,109,303, 12,343,670
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1191the total stopping time
Highest value reached106,769,82486× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,234,367 → 3,703,102 → 1,851,551 → 5,554,654 → 2,777,327 → 8,331,982 → 4,165,991 → 12,497,974 → 6,248,987 → 18,746,962 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage123,436,700%
1,234,367% as a decimal12,343.67
1,234,367% of 1001,234,367
1,234,367% of 1,00012,343,670
As a fraction of 1001,234,367/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 1,234,367
Nerdulate something else
Nothing in mind? Surprise me · today’s page