Recognised as Number
2,240,477
- Positive
- Odd
- Prime
- 7 digits
2,240,477 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 value2,240,477
Digit count7
Digit sum26
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 factorisation2,240,477
Distinct prime factors12,240,477
Number of divisors2
Sum of divisors σ(n)2,240,478
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,240,476integers below n that share no factor with it
Carmichael function λ(n)2,240,476the 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, 2,240,4772 in total
Arithmetic
Previous number2,240,476
Next number2,240,478
Double4,480,954
Half1,120,238.5
Square5,019,737,187,529
Cube11,246,605,714,703,411,333
Square root1,496.822300742≈irrational, shown to 9 decimal places
Cube root130.85193924≈
Negation-2,240,477
Reciprocal4.46333526 × 10^-7≈
Representations
Decimal2,240,477
Binary100010001011111101110122 bits
Octal10427735
Hexadecimal222FDD
Base 361C0RH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and forty thousand, four hundred and seventy-seven
Ordinaltwo million, two hundred and forty thousand, four hundred and seventy-seventh
Scientific notation2.240477 × 10^6
Engineering notation2.240477 × 10^6
In other bases
Ternary11012211100122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1033143402base 5; one hand: 10 digits
Septenary25021001base 7: 8 digits
Nonary4184318base 9; each digit is two ternary digits: 7 digits
Duodecimal9006a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimale013hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:22:21:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0T11101T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100111000000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100010111111011101
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
Bytes322 2f dd
Gray code1100110011100000110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100010111111011101
64-bit0000000000000000000000000000000000000000001000100010111111011101
One's complement11111111110111011101000000100010at 32 bits, every bit flipped
Bits reversed10111011111101000100010000000000at 32 bits
Rotated left by 100000000010001000101111110111010at 32 bits, wrapping
Shifted left by 110001000101111110111010= 4,480,954, no wrap
Shifted right by 1100010001011111101110= 1,120,238, discarding the low bit
These bits as a double1.10694272 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,240,477 to the power 25,019,737,187,529
2,240,477 to the power 311,246,605,714,703,411,333
2,240,477 to the power 425,197,761,431,861,554,913,125,841
2,240,477 to the power 556,455,004,939,572,880,967,095,444,866,157
First ten multiples2,240,477, 4,480,954, 6,721,431, 8,961,908, 11,202,385, 13,442,862, 15,683,339, 17,923,816, 20,164,293, 22,404,770
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1117the total stopping time
Highest value reached6,721,4323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,240,477 → 6,721,432 → 3,360,716 → 1,680,358 → 840,179 → 2,520,538 → 1,260,269 → 3,780,808 → 1,890,404 → 945,202 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage224,047,700%
2,240,477% as a decimal22,404.77
2,240,477% of 1002,240,477
2,240,477% of 1,00022,404,770
As a fraction of 1002,240,477/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 2,240,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page