Base | Representation |
---|---|
bin | 1011000010101101100100… |
… | …1011101101001101011010 |
3 | 1120222200121120212121110220 |
4 | 2300223121023231031122 |
5 | 3042410210123200010 |
6 | 41453333340420510 |
7 | 2362113532204233 |
oct | 260533113551532 |
9 | 46880546777426 |
10 | 12141221303130 |
11 | 39610769a5077 |
12 | 1441072547736 |
13 | 6a0bb22c464a |
14 | 2dd8d14c408a |
15 | 160c4ae89970 |
hex | b0ad92ed35a |
12141221303130 has 16 divisors (see below), whose sum is σ = 29138931127584. Its totient is φ = 3237659014160.
The previous prime is 12141221303087. The next prime is 12141221303149. The reversal of 12141221303130 is 3130312214121.
It is a self number, because there is not a number n which added to its sum of digits gives 12141221303130.
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, 202353688356 + ... + 202353688415.
It is an arithmetic number, because the mean of its divisors is an integer number (1821183195474).
Almost surely, 212141221303130 is an apocalyptic number.
12141221303130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12141221303130 is an abundant number, since it is smaller than the sum of its proper divisors (16997709824454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12141221303130 is a wasteful number, since it uses less digits than its factorization.
12141221303130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404707376781.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 12141221303130 its reverse (3130312214121), we get a palindrome (15271533517251).
The spelling of 12141221303130 in words is "twelve trillion, one hundred forty-one billion, two hundred twenty-one million, three hundred three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •