Base | Representation |
---|---|
bin | 1011011010000011010110… |
… | …0000110100111001110110 |
3 | 1122102000121122100220000210 |
4 | 2312200311200310321312 |
5 | 3120442412242131240 |
6 | 42401450323050250 |
7 | 2433100315360410 |
oct | 266406540647166 |
9 | 48360548326023 |
10 | 12542202302070 |
11 | 3aa61332524a1 |
12 | 14a691a210986 |
13 | 6cc955c4931c |
14 | 31508da899b0 |
15 | 16b3b8a5e780 |
hex | b6835834e76 |
12542202302070 has 64 divisors (see below), whose sum is σ = 34401751128576. Its totient is φ = 2866765601280.
The previous prime is 12542202302057. The next prime is 12542202302129. The reversal of 12542202302070 is 7020320224521.
12542202302070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 48453790 + ... + 48711950.
It is an arithmetic number, because the mean of its divisors is an integer number (537527361384).
Almost surely, 212542202302070 is an apocalyptic number.
12542202302070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12542202302070 is an abundant number, since it is smaller than the sum of its proper divisors (21859548826506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12542202302070 is a wasteful number, since it uses less digits than its factorization.
12542202302070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 489525.
The product of its (nonzero) digits is 13440, while the sum is 30.
Adding to 12542202302070 its reverse (7020320224521), we get a palindrome (19562522526591).
The spelling of 12542202302070 in words is "twelve trillion, five hundred forty-two billion, two hundred two million, three hundred two thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •