Recognised as Number
3,532,019
- Positive
- Odd
- Prime
- 7 digits
3,532,019 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,532,019
Digit count7
Digit sum23
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,532,019
Distinct prime factors13,532,019
Number of divisors2
Sum of divisors σ(n)3,532,020
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,532,018integers below n that share no factor with it
Carmichael function λ(n)3,532,018the 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, 3,532,0192 in total
Arithmetic
Previous number3,532,018
Next number3,532,020
Double7,064,038
Half1,766,009.5
Square12,475,158,216,361
Cube44,062,495,848,193,162,859
Square root1,879.366648635≈irrational, shown to 9 decimal places
Cube root152.29103692≈
Negation-3,532,019
Reciprocal2.83124185 × 10^-7≈
Representations
Decimal3,532,019
Binary110101111001001111001122 bits
Octal15362363
Hexadecimal35E4F3
Base 3623PBN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and thirty-two thousand and nineteen
Ordinalthree million, five hundred and thirty-two thousand and nineteenth
Scientific notation3.532019 × 10^6
Engineering notation3.532019 × 10^6
In other bases
Ternary20122110000112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1401011034base 5; one hand: 10 digits
Septenary42010301base 7: 8 digits
Nonary6573015base 9; each digit is two ternary digits: 7 digits
Duodecimal1223babbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal121a0jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:21:6:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T0T110001TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100010010100110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101011110010011110011
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes335 e4 f3
Gray code1011110001011010001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101011110010011110011
64-bit0000000000000000000000000000000000000000001101011110010011110011
One's complement11111111110010100001101100001100at 32 bits, every bit flipped
Bits reversed11001111001001111010110000000000at 32 bits
Rotated left by 100000000011010111100100111100110at 32 bits, wrapping
Shifted left by 111010111100100111100110= 7,064,038, no wrap
Shifted right by 1110101111001001111001= 1,766,009, discarding the low bit
These bits as a double1.74504925 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,532,019 to the power 212,475,158,216,361
3,532,019 to the power 344,062,495,848,193,162,859
3,532,019 to the power 4155,629,572,523,239,366,888,082,321
3,532,019 to the power 5549,686,607,113,959,385,396,677,631,336,099
First ten multiples3,532,019, 7,064,038, 10,596,057, 14,128,076, 17,660,095, 21,192,114, 24,724,133, 28,256,152, 31,788,171, 35,320,190
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 19
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached15,894,0884× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,532,019 → 10,596,058 → 5,298,029 → 15,894,088 → 7,947,044 → 3,973,522 → 1,986,761 → 5,960,284 → 2,980,142 → 1,490,071 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage353,201,900%
3,532,019% as a decimal35,320.19
3,532,019% of 1003,532,019
3,532,019% of 1,00035,320,190
As a fraction of 1003,532,019/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 3,532,019
Nerdulate something else
Nothing in mind? Surprise me · today’s page