Recognised as Number
1,400,531
- Positive
- Odd
- Composite
- 7 digits
1,400,531 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,400,531
Digit count7
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 127,321
Distinct prime factors211, 127,321
Number of divisors4
Sum of divisors σ(n)1,527,864
Aliquot sum127,333sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,273,200integers below n that share no factor with it
Carmichael function λ(n)127,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,273,200
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 127,321, 1,400,5314 in total
Arithmetic
Previous number1,400,530
Next number1,400,532
Double2,801,062
Half700,265.5
Square1,961,487,081,961
Cube2,747,123,464,385,921,291
Square root1,183.440323802≈irrational, shown to 9 decimal places
Cube root111.883035845≈
Negation-1,400,531
Reciprocal7.14014899 × 10^-7≈
Representations
Decimal1,400,531
Binary10101010111101101001121 bits
Octal5257323
Hexadecimal155ED3
Base 36U0NN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred thousand, five hundred and thirty-one
Ordinalone million, four hundred thousand, five hundred and thirty-first
Scientific notation1.400531 × 10^6
Engineering notation1.400531 × 10^6
In other bases
Ternary2122011011112base 3; the most digit-efficient integer base after e: 13 digits
Quinary324304111base 5; one hand: 9 digits
Septenary14622116base 7: 8 digits
Nonary2564145base 9; each digit is two ternary digits: 7 digits
Duodecimal5765abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8f16bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:29:2:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T0111TTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101010001111010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010101111011010011
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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 5e d3
Gray code111111111000110111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010101111011010011
64-bit0000000000000000000000000000000000000000000101010101111011010011
One's complement11111111111010101010000100101100at 32 bits, every bit flipped
Bits reversed11001011011110101010100000000000at 32 bits
Rotated left by 100000000001010101011110110100110at 32 bits, wrapping
Shifted left by 11010101011110110100110= 2,801,062, no wrap
Shifted right by 110101010111101101001= 700,265, discarding the low bit
These bits as a double6.91954253 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,400,531 to the power 21,961,487,081,961
1,400,531 to the power 32,747,123,464,385,921,291
1,400,531 to the power 43,847,431,572,699,878,731,605,521
1,400,531 to the power 55,388,447,187,944,933,859,854,211,931,651
First ten multiples1,400,531, 2,801,062, 4,201,593, 5,602,124, 7,002,655, 8,403,186, 9,803,717, 11,204,248, 12,604,779, 14,005,310
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 175the total stopping time
Highest value reached6,302,3924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,400,531 → 4,201,594 → 2,100,797 → 6,302,392 → 3,151,196 → 1,575,598 → 787,799 → 2,363,398 → 1,181,699 → 3,545,098 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,053,100%
1,400,531% as a decimal14,005.31
1,400,531% of 1001,400,531
1,400,531% of 1,00014,005,310
As a fraction of 1001,400,531/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,400,531
Nerdulate something else
Nothing in mind? Surprise me · today’s page