Recognised as Number
1,401,231
- Positive
- Odd
- Composite
- 7 digits
1,401,231 is an odd 7-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,401,231
Digit count7
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 13 × 19 × 31 × 61
Distinct prime factors53, 13, 19, 31, 61
Number of divisors32
Sum of divisors σ(n)2,222,080
Aliquot sum820,849sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)777,600integers below n that share no factor with it
Carmichael function λ(n)180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 777,600
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 19, 31, 39, 57, 61, 93, 183, 247, 403, 589, 741, 793, 1,159, 1,209, 1,767, 1,891, 2,379, 3,477, 5,673, 7,657, 15,067, 22,971, 24,583, 35,929, 45,201, 73,749, 107,787, 467,077, 1,401,23132 in total
Arithmetic
Previous number1,401,230
Next number1,401,232
Double2,802,462
Half700,615.5
Square1,963,448,315,361
Cube2,751,244,646,381,609,391
Square root1,183.736034765≈irrational, shown to 9 decimal places
Cube root111.901672843≈
Negation-1,401,231
Reciprocal7.13658205 × 10^-7≈
Representations
Decimal1,401,231
Binary10101011000011000111121 bits
Octal5260617
Hexadecimal15618F
Base 36U173
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and one thousand, two hundred and thirty-one
Ordinalone million, four hundred and one thousand, two hundred and thirty-first
Scientific notation1.401231 × 10^6
Engineering notation1.401231 × 10^6
In other bases
Ternary2122012010110base 3; the most digit-efficient integer base after e: 13 digits
Quinary324314411base 5; one hand: 9 digits
Septenary14624136base 7: 8 digits
Nonary2565113base 9; each digit is two ternary digits: 7 digits
Duodecimal576a93base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8f31bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:29:13:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T1TT010110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101010011010010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010110000110001111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; 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
Bytes315 61 8f
Gray code111111101000101001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010110000110001111
64-bit0000000000000000000000000000000000000000000101010110000110001111
One's complement11111111111010101001111001110000at 32 bits, every bit flipped
Bits reversed11110001100001101010100000000000at 32 bits
Rotated left by 100000000001010101100001100011110at 32 bits, wrapping
Shifted left by 11010101100001100011110= 2,802,462, no wrap
Shifted right by 110101011000011000111= 700,615, discarding the low bit
These bits as a double6.92300099 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,401,231 to the power 21,963,448,315,361
1,401,231 to the power 32,751,244,646,381,609,391
1,401,231 to the power 43,855,129,287,093,948,908,560,321
1,401,231 to the power 55,401,926,666,083,941,123,090,887,155,151
First ten multiples1,401,231, 2,802,462, 4,203,693, 5,604,924, 7,006,155, 8,407,386, 9,808,617, 11,209,848, 12,611,079, 14,012,310
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1129the total stopping time
Highest value reached14,187,47210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,401,231 → 4,203,694 → 2,101,847 → 6,305,542 → 3,152,771 → 9,458,314 → 4,729,157 → 14,187,472 → 7,093,736 → 3,546,868 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,123,100%
1,401,231% as a decimal14,012.31
1,401,231% of 1001,401,231
1,401,231% of 1,00014,012,310
As a fraction of 1001,401,231/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,401,231
Nerdulate something else
Nothing in mind? Surprise me · today’s page