Base | Representation |
---|---|
bin | 100001101001101111111… |
… | …101100101010111001000 |
3 | 22012002011000222200221121 |
4 | 201221233331211113020 |
5 | 300342121112220130 |
6 | 4530214054245024 |
7 | 326035442431465 |
oct | 41515775452710 |
9 | 8162130880847 |
10 | 2312570820040 |
11 | 811834a37258 |
12 | 314237356774 |
13 | 13a0c7877720 |
14 | 7dd0135c66c |
15 | 4024e0b3d7a |
hex | 21a6ff655c8 |
2312570820040 has 32 divisors (see below), whose sum is σ = 5603536988280. Its totient is φ = 853872302592.
The previous prime is 2312570820037. The next prime is 2312570820059. The reversal of 2312570820040 is 400280752132.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1806051083236 + 506519736804 = 1343894^2 + 711702^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2312570819978 and 2312570820005.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2223625269 + ... + 2223626308.
Almost surely, 22312570820040 is an apocalyptic number.
2312570820040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2312570820040 is an abundant number, since it is smaller than the sum of its proper divisors (3290966168240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2312570820040 is a wasteful number, since it uses less digits than its factorization.
2312570820040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4447251601 (or 4447251597 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 34.
The spelling of 2312570820040 in words is "two trillion, three hundred twelve billion, five hundred seventy million, eight hundred twenty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •