Base | Representation |
---|---|
bin | 101011110101010001000… |
… | …111111110111111010000 |
3 | 101122221211201212201212000 |
4 | 223311101013332333100 |
5 | 343322322034401000 |
6 | 10223431014234000 |
7 | 430422316043442 |
oct | 53652107767720 |
9 | 11587751781760 |
10 | 3012133122000 |
11 | a61490691932 |
12 | 407931355900 |
13 | 18b073434232 |
14 | a5b06488492 |
15 | 53544a0d000 |
hex | 2bd511fefd0 |
3012133122000 has 160 divisors (see below), whose sum is σ = 10790130399360. Its totient is φ = 803235484800.
The previous prime is 3012133121929. The next prime is 3012133122109. The reversal of 3012133122000 is 2213312103.
3012133122000 is a `hidden beast` number, since 30 + 121 + 3 + 312 + 200 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27836122 + ... + 27944121.
It is an arithmetic number, because the mean of its divisors is an integer number (67438314996).
Almost surely, 23012133122000 is an apocalyptic number.
3012133122000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3012133122000 is an abundant number, since it is smaller than the sum of its proper divisors (7777997277360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3012133122000 is a wasteful number, since it uses less digits than its factorization.
3012133122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55780275 (or 55780253 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 3012133122000 its reverse (2213312103), we get a palindrome (3014346434103).
The spelling of 3012133122000 in words is "three trillion, twelve billion, one hundred thirty-three million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •