Recognised as Number
3,428,099
- Positive
- Odd
- Prime
- 7 digits
3,428,099 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,428,099
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,428,099
Distinct prime factors13,428,099
Number of divisors2
Sum of divisors σ(n)3,428,100
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,428,098integers below n that share no factor with it
Carmichael function λ(n)3,428,098the 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,428,0992 in total
Arithmetic
Previous number3,428,098
Next number3,428,100
Double6,856,198
Half1,714,049.5
Square11,751,862,753,801
Cube40,286,548,954,442,454,299
Square root1,851.512624856≈irrational, shown to 9 decimal places
Cube root150.782562063≈
Negation-3,428,099
Reciprocal2.91706861 × 10^-7≈
Representations
Decimal3,428,099
Binary110100010011110000001122 bits
Octal15047403
Hexadecimal344F03
Base 3621H4Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and twenty-eight thousand and ninety-nine
Ordinalthree million, four hundred and twenty-eight thousand and ninety-ninth
Scientific notation3.428099 × 10^6
Engineering notation3.428099 × 10^6
In other bases
Ternary20110011110122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1334144344base 5; one hand: 10 digits
Septenary41065313base 7: 8 digits
Nonary6404418base 9; each digit is two ternary digits: 7 digits
Duodecimal1193a2bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal118a4jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:52:14:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0110011111T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000101001100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101000100111100000011
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes334 4f 03
Gray code1011100110100010000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101000100111100000011
64-bit0000000000000000000000000000000000000000001101000100111100000011
One's complement11111111110010111011000011111100at 32 bits, every bit flipped
Bits reversed11000000111100100010110000000000at 32 bits
Rotated left by 100000000011010001001111000000110at 32 bits, wrapping
Shifted left by 111010001001111000000110= 6,856,198, no wrap
Shifted right by 1110100010011110000001= 1,714,049, discarding the low bit
These bits as a double1.69370595 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,428,099 to the power 211,751,862,753,801
3,428,099 to the power 340,286,548,954,442,454,299
3,428,099 to the power 4138,106,278,184,175,223,139,947,601
3,428,099 to the power 5473,441,994,136,892,898,270,831,231,040,499
First ten multiples3,428,099, 6,856,198, 10,284,297, 13,712,396, 17,140,495, 20,568,594, 23,996,693, 27,424,792, 30,852,891, 34,280,990
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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1128the total stopping time
Highest value reached15,426,4484× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,428,099 → 10,284,298 → 5,142,149 → 15,426,448 → 7,713,224 → 3,856,612 → 1,928,306 → 964,153 → 2,892,460 → 1,446,230 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage342,809,900%
3,428,099% as a decimal34,280.99
3,428,099% of 1003,428,099
3,428,099% of 1,00034,280,990
As a fraction of 1003,428,099/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,428,099
Nerdulate something else
Nothing in mind? Surprise me · today’s page