Recognised as Number
1,446,937
- Positive
- Odd
- Composite
- 7 digits
1,446,937 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,446,937
Digit count7
Digit sum34
Digit product18,144
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation977 × 1,481
Distinct prime factors2977, 1,481
Number of divisors4
Sum of divisors σ(n)1,449,396
Aliquot sum2,459sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,444,480integers below n that share no factor with it
Carmichael function λ(n)180,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,444,480
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 977, 1,481, 1,446,9374 in total
Arithmetic
Previous number1,446,936
Next number1,446,938
Double2,893,874
Half723,468.5
Square2,093,626,681,969
Cube3,029,345,910,328,178,953
Square root1,202.886943981≈irrational, shown to 9 decimal places
Cube root113.105365476≈
Negation-1,446,937
Reciprocal6.91115093 × 10^-7≈
Representations
Decimal1,446,937
Binary10110000101000001100121 bits
Octal5412031
Hexadecimal161419
Base 36V0GP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and forty-six thousand, nine hundred and thirty-seven
Ordinalone million, four hundred and forty-six thousand, nine hundred and thirty-seventh
Scientific notation1.446937 × 10^6
Engineering notation1.446937 × 10^6
In other bases
Ternary2201111211021base 3; the most digit-efficient integer base after e: 13 digits
Quinary332300222base 5; one hand: 9 digits
Septenary15204322base 7: 8 digits
Nonary2644737base 9; each digit is two ternary digits: 7 digits
Duodecimal599421base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal90h6hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:41:55:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1TTTTT111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100001010001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100001010000011001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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 14 19
Gray code111010001111000010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100001010000011001
64-bit0000000000000000000000000000000000000000000101100001010000011001
One's complement11111111111010011110101111100110at 32 bits, every bit flipped
Bits reversed10011000001010000110100000000000at 32 bits
Rotated left by 100000000001011000010100000110010at 32 bits, wrapping
Shifted left by 11011000010100000110010= 2,893,874, no wrap
Shifted right by 110110000101000001100= 723,468, discarding the low bit
These bits as a double7.14881863 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,446,937 to the power 22,093,626,681,969
1,446,937 to the power 33,029,345,910,328,178,953
1,446,937 to the power 44,383,272,683,452,524,269,716,961
1,446,937 to the power 56,342,319,426,776,745,109,251,450,398,457
First ten multiples1,446,937, 2,893,874, 4,340,811, 5,787,748, 7,234,685, 8,681,622, 10,128,559, 11,575,496, 13,022,433, 14,469,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 167the total stopping time
Highest value reached4,883,4163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,446,937 → 4,340,812 → 2,170,406 → 1,085,203 → 3,255,610 → 1,627,805 → 4,883,416 → 2,441,708 → 1,220,854 → 610,427 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage144,693,700%
1,446,937% as a decimal14,469.37
1,446,937% of 1001,446,937
1,446,937% of 1,00014,469,370
As a fraction of 1001,446,937/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,446,937
Nerdulate something else
Nothing in mind? Surprise me · today’s page