Base | Representation |
---|---|
bin | 1001000110001101010111… |
… | …0111000100001101001000 |
3 | 1022102012121112010001100202 |
4 | 2101203111313010031020 |
5 | 2302334123043102430 |
6 | 33134551422351332 |
7 | 2051432422622531 |
oct | 221432567041510 |
9 | 38365545101322 |
10 | 10002271847240 |
11 | 3206a37776522 |
12 | 115661072b548 |
13 | 577296a2442a |
14 | 268180b4d688 |
15 | 1252ae602d45 |
hex | 918d5dc4348 |
10002271847240 has 32 divisors (see below), whose sum is σ = 22519098819000. Its totient is φ = 3998422132224.
The previous prime is 10002271847167. The next prime is 10002271847257. The reversal of 10002271847240 is 4274817220001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 9160755502276 + 841516344964 = 3026674^2 + 917342^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10002271847194 and 10002271847203.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77641295 + ... + 77770014.
Almost surely, 210002271847240 is an apocalyptic number.
10002271847240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10002271847240 is an abundant number, since it is smaller than the sum of its proper divisors (12516826971760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10002271847240 is a wasteful number, since it uses less digits than its factorization.
10002271847240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155412929 (or 155412925 counting only the distinct ones).
The product of its (nonzero) digits is 50176, while the sum is 38.
The spelling of 10002271847240 in words is "ten trillion, two billion, two hundred seventy-one million, eight hundred forty-seven thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •