Recognised as Number
1,464,199
- Positive
- Odd
- Composite
- 7 digits
1,464,199 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,464,199
Digit count7
Digit sum34
Digit product7,776
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 factorisation11 × 133,109
Distinct prime factors211, 133,109
Number of divisors4
Sum of divisors σ(n)1,597,320
Aliquot sum133,121sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,331,080integers below n that share no factor with it
Carmichael function λ(n)665,540the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,331,080
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 133,109, 1,464,1994 in total
Arithmetic
Previous number1,464,198
Next number1,464,200
Double2,928,398
Half732,099.5
Square2,143,878,711,601
Cube3,139,065,065,647,472,599
Square root1,210.040908399≈irrational, shown to 9 decimal places
Cube root113.553372015≈
Negation-1,464,199
Reciprocal6.82967274 × 10^-7≈
Representations
Decimal1,464,199
Binary10110010101111000011121 bits
Octal5453607
Hexadecimal165787
Base 36VDS7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and sixty-four thousand, one hundred and ninety-nine
Ordinalone million, four hundred and sixty-four thousand, one hundred and ninety-ninth
Scientific notation1.464199 × 10^6
Engineering notation1.464199 × 10^6
In other bases
Ternary2202101111121base 3; the most digit-efficient integer base after e: 13 digits
Quinary333323244base 5; one hand: 9 digits
Septenary15305542base 7: 8 digits
Nonary2671447base 9; each digit is two ternary digits: 7 digits
Duodecimal5a7407base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9309jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:46:43:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T11TTTTTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111010100010011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100101011110000111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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
Bytes316 57 87
Gray code111010111110001000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100101011110000111
64-bit0000000000000000000000000000000000000000000101100101011110000111
One's complement11111111111010011010100001111000at 32 bits, every bit flipped
Bits reversed11100001111010100110100000000000at 32 bits
Rotated left by 100000000001011001010111100001110at 32 bits, wrapping
Shifted left by 11011001010111100001110= 2,928,398, no wrap
Shifted right by 110110010101111000011= 732,099, discarding the low bit
These bits as a double7.23410425 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,464,199 to the power 22,143,878,711,601
1,464,199 to the power 33,139,065,065,647,472,599
1,464,199 to the power 44,596,215,930,055,963,731,983,201
1,464,199 to the power 56,729,774,768,572,012,040,406,070,920,999
First ten multiples1,464,199, 2,928,398, 4,392,597, 5,856,796, 7,320,995, 8,785,194, 10,249,393, 11,713,592, 13,177,791, 14,641,990
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1181the total stopping time
Highest value reached9,883,3486× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,464,199 → 4,392,598 → 2,196,299 → 6,588,898 → 3,294,449 → 9,883,348 → 4,941,674 → 2,470,837 → 7,412,512 → 3,706,256 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage146,419,900%
1,464,199% as a decimal14,641.99
1,464,199% of 1001,464,199
1,464,199% of 1,00014,641,990
As a fraction of 1001,464,199/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,464,199
Nerdulate something else
Nothing in mind? Surprise me · today’s page