Recognised as Number
3,269,437
- Positive
- Odd
- Prime
- 7 digits
3,269,437 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 value3,269,437
Digit count7
Digit sum34
Digit product27,216
Multiplicative persistence5times 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 factorisation3,269,437
Distinct prime factors13,269,437
Number of divisors2
Sum of divisors σ(n)3,269,438
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,269,436integers below n that share no factor with it
Carmichael function λ(n)3,269,436the 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,269,4372 in total
Arithmetic
Previous number3,269,436
Next number3,269,438
Double6,538,874
Half1,634,718.5
Square10,689,218,296,969
Cube34,947,725,801,187,436,453
Square root1,808.158455446≈irrational, shown to 9 decimal places
Cube root148.419509184≈
Negation-3,269,437
Reciprocal3.05863058 × 10^-7≈
Representations
Decimal3,269,437
Binary110001111000110011110122 bits
Octal14361475
Hexadecimal31E33D
Base 361Y2PP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and sixty-nine thousand, four hundred and thirty-seven
Ordinalthree million, two hundred and sixty-nine thousand, four hundred and thirty-seventh
Scientific notation3.269437 × 10^6
Engineering notation3.269437 × 10^6
In other bases
Ternary20011002211021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1314110222base 5; one hand: 10 digits
Septenary36534613base 7: 8 digits
Nonary6132737base 9; each digit is two ternary digits: 7 digits
Duodecimal1118051base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal108dbhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:8:10:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0011010T111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100010011101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100011110001100111101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes331 e3 3d
Gray code1010010001001010100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100011110001100111101
64-bit0000000000000000000000000000000000000000001100011110001100111101
One's complement11111111110011100001110011000010at 32 bits, every bit flipped
Bits reversed10111100110001111000110000000000at 32 bits
Rotated left by 100000000011000111100011001111010at 32 bits, wrapping
Shifted left by 111000111100011001111010= 6,538,874, no wrap
Shifted right by 1110001111000110011110= 1,634,718, discarding the low bit
These bits as a double1.6153165 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,269,437 to the power 210,689,218,296,969
3,269,437 to the power 334,947,725,801,187,436,453
3,269,437 to the power 4114,259,387,800,256,848,674,586,961
3,269,437 to the power 5373,563,870,071,508,350,560,095,570,010,957
First ten multiples3,269,437, 6,538,874, 9,808,311, 13,077,748, 16,347,185, 19,616,622, 22,886,059, 26,155,496, 29,424,933, 32,694,370
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached11,783,2843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,269,437 → 9,808,312 → 4,904,156 → 2,452,078 → 1,226,039 → 3,678,118 → 1,839,059 → 5,517,178 → 2,758,589 → 8,275,768 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage326,943,700%
3,269,437% as a decimal32,694.37
3,269,437% of 1003,269,437
3,269,437% of 1,00032,694,370
As a fraction of 1003,269,437/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,269,437
Nerdulate something else
Nothing in mind? Surprise me · today’s page