Recognised as Number
1,534,021
- Positive
- Odd
- Prime
- 7 digits
1,534,021 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,534,021
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation1,534,021
Distinct prime factors11,534,021
Number of divisors2
Sum of divisors σ(n)1,534,022
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,534,020integers below n that share no factor with it
Carmichael function λ(n)1,534,020the 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,534,0212 in total
Arithmetic
Previous number1,534,020
Next number1,534,022
Double3,068,042
Half767,010.5
Square2,353,220,428,441
Cube3,609,889,554,857,491,261
Square root1,238.556014074≈irrational, shown to 9 decimal places
Cube root115.330392038≈
Negation-1,534,021
Reciprocal6.51881558 × 10^-7≈
Representations
Decimal1,534,021
Binary10111011010000100010121 bits
Octal5664105
Hexadecimal176845
Base 36WVNP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and thirty-four thousand and twenty-one
Ordinalone million, five hundred and thirty-four thousand and twenty-first
Scientific notation1.534021 × 10^6
Engineering notation1.534021 × 10^6
In other bases
Ternary2212221021121base 3; the most digit-efficient integer base after e: 13 digits
Quinary343042041base 5; one hand: 9 digits
Septenary16016236base 7: 8 digits
Nonary2787247base 9; each digit is two ternary digits: 7 digits
Duodecimal61b8b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9bf11base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:6:7:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T00T110TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001011100001000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101110110100001000101
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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
Bytes317 68 45
Gray code111001101110001100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101110110100001000101
64-bit0000000000000000000000000000000000000000000101110110100001000101
One's complement11111111111010001001011110111010at 32 bits, every bit flipped
Bits reversed10100010000101101110100000000000at 32 bits
Rotated left by 100000000001011101101000010001010at 32 bits, wrapping
Shifted left by 11011101101000010001010= 3,068,042, no wrap
Shifted right by 110111011010000100010= 767,010, discarding the low bit
These bits as a double7.57907076 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,534,021 to the power 22,353,220,428,441
1,534,021 to the power 33,609,889,554,857,491,261
1,534,021 to the power 45,537,646,384,832,043,601,690,481
1,534,021 to the power 58,494,865,844,906,436,357,908,833,354,101
First ten multiples1,534,021, 3,068,042, 4,602,063, 6,136,084, 7,670,105, 9,204,126, 10,738,147, 12,272,168, 13,806,189, 15,340,210
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 157the total stopping time
Highest value reached4,602,0643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,534,021 → 4,602,064 → 2,301,032 → 1,150,516 → 575,258 → 287,629 → 862,888 → 431,444 → 215,722 → 107,861 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage153,402,100%
1,534,021% as a decimal15,340.21
1,534,021% of 1001,534,021
1,534,021% of 1,00015,340,210
As a fraction of 1001,534,021/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,534,021
Nerdulate something else
Nothing in mind? Surprise me · today’s page