Recognised as Number
3,429,779
- Positive
- Odd
- Prime
- 7 digits
3,429,779 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,429,779
Digit count7
Digit sum41
Digit product95,256
Multiplicative persistence3times 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 factorisation3,429,779
Distinct prime factors13,429,779
Number of divisors2
Sum of divisors σ(n)3,429,780
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,429,778integers below n that share no factor with it
Carmichael function λ(n)3,429,778the 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,429,7792 in total
Arithmetic
Previous number3,429,778
Next number3,429,780
Double6,859,558
Half1,714,889.5
Square11,763,383,988,841
Cube40,345,807,373,863,096,139
Square root1,851.966252392≈irrational, shown to 9 decimal places
Cube root150.807189253≈
Negation-3,429,779
Reciprocal2.91563975 × 10^-7≈
Representations
Decimal3,429,779
Binary110100010101011001001122 bits
Octal15052623
Hexadecimal345593
Base 3621IFN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and twenty-nine thousand, seven hundred and seventy-nine
Ordinalthree million, four hundred and twenty-nine thousand, seven hundred and seventy-ninth
Scientific notation3.429779 × 10^6
Engineering notation3.429779 × 10^6
In other bases
Ternary20110020202212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1334223104base 5; one hand: 10 digits
Septenary41103233base 7: 8 digits
Nonary6406685base 9; each digit is two ternary digits: 7 digits
Duodecimal11949abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal118e8jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:52:42:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01101T1T100TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011010101010010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101000101010110010011
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; 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 55 93
Gray code1011100111111101011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101000101010110010011
64-bit0000000000000000000000000000000000000000001101000101010110010011
One's complement11111111110010111010101001101100at 32 bits, every bit flipped
Bits reversed11001001101010100010110000000000at 32 bits
Rotated left by 100000000011010001010101100100110at 32 bits, wrapping
Shifted left by 111010001010101100100110= 6,859,558, no wrap
Shifted right by 1110100010101011001001= 1,714,889, discarding the low bit
These bits as a double1.69453598 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,429,779 to the power 211,763,383,988,841
3,429,779 to the power 340,345,807,373,863,096,139
3,429,779 to the power 4138,377,202,868,920,796,012,523,281
3,429,779 to the power 5474,603,224,478,564,298,827,036,086,184,899
First ten multiples3,429,779, 6,859,558, 10,289,337, 13,719,116, 17,148,895, 20,578,674, 24,008,453, 27,438,232, 30,868,011, 34,297,790
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 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached15,434,0084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,429,779 → 10,289,338 → 5,144,669 → 15,434,008 → 7,717,004 → 3,858,502 → 1,929,251 → 5,787,754 → 2,893,877 → 8,681,632 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage342,977,900%
3,429,779% as a decimal34,297.79
3,429,779% of 1003,429,779
3,429,779% of 1,00034,297,790
As a fraction of 1003,429,779/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,429,779
Nerdulate something else
Nothing in mind? Surprise me · today’s page