Base | Representation |
---|---|
bin | 10110110010000110… |
… | …10100010110000110 |
3 | 1011120102122120002120 |
4 | 23121003110112012 |
5 | 200022223211410 |
6 | 5341414350410 |
7 | 612051460623 |
oct | 133103242606 |
9 | 34512576076 |
10 | 12231460230 |
11 | 5207382120 |
12 | 245435b406 |
13 | 11cc0b5642 |
14 | 84066d34a |
15 | 4b8c41570 |
hex | 2d90d4586 |
12231460230 has 128 divisors (see below), whose sum is σ = 32375185920. Its totient is φ = 2932899840.
The previous prime is 12231460229. The next prime is 12231460247. The reversal of 12231460230 is 3206413221.
It is a self number, because there is not a number n which added to its sum of digits gives 12231460230.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 15905286 + ... + 15906054.
It is an arithmetic number, because the mean of its divisors is an integer number (252931140).
Almost surely, 212231460230 is an apocalyptic number.
12231460230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12231460230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16187592960).
12231460230 is an abundant number, since it is smaller than the sum of its proper divisors (20143725690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12231460230 is a wasteful number, since it uses less digits than its factorization.
12231460230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 12231460230 its reverse (3206413221), we get a palindrome (15437873451).
The spelling of 12231460230 in words is "twelve billion, two hundred thirty-one million, four hundred sixty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •