Base | Representation |
---|---|
bin | 10110111011100101… |
… | …10100010111100110 |
3 | 1011202222100122222212 |
4 | 23131302310113212 |
5 | 200203110133110 |
6 | 5353335523422 |
7 | 614035644410 |
oct | 133562642746 |
9 | 34688318885 |
10 | 12311021030 |
11 | 5248283350 |
12 | 2476b29572 |
13 | 1212720b39 |
14 | 84b05d9b0 |
15 | 4c0c09e05 |
hex | 2ddcb45e6 |
12311021030 has 32 divisors (see below), whose sum is σ = 27627851520. Its totient is φ = 3837201120.
The previous prime is 12311021017. The next prime is 12311021033. The reversal of 12311021030 is 3012011321.
It is a super-2 number, since 2×123110210302 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12311020996 and 12311021014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12311021033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7993400 + ... + 7994939.
It is an arithmetic number, because the mean of its divisors is an integer number (863370360).
Almost surely, 212311021030 is an apocalyptic number.
12311021030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12311021030 is an abundant number, since it is smaller than the sum of its proper divisors (15316830490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12311021030 is a wasteful number, since it uses less digits than its factorization.
12311021030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15988364.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 12311021030 its reverse (3012011321), we get a palindrome (15323032351).
The spelling of 12311021030 in words is "twelve billion, three hundred eleven million, twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •