Base | Representation |
---|---|
bin | 1101101010010010110111… |
… | …10111010101010100100011 |
3 | 10221100211220001120011021001 |
4 | 12311021123313111110203 |
5 | 12414141012340001011 |
6 | 143520233521412431 |
7 | 6220233435064102 |
oct | 665113367252443 |
9 | 127324801504231 |
10 | 30040542500131 |
11 | 96321390a4509 |
12 | 3452084a9a117 |
13 | 139ba70a073b7 |
14 | 75bd81a14039 |
15 | 3716542217c1 |
hex | 1b525bdd5523 |
30040542500131 has 8 divisors (see below), whose sum is σ = 30109525282224. Its totient is φ = 29971609368480.
The previous prime is 30040542500069. The next prime is 30040542500167. The reversal of 30040542500131 is 13100524504003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30040542500131 - 217 = 30040542369059 is a prime.
It is a super-2 number, since 2×300405425001312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30040542500131.
It is not an unprimeable number, because it can be changed into a prime (30040542504131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11201005 + ... + 13621438.
It is an arithmetic number, because the mean of its divisors is an integer number (3763690660278).
Almost surely, 230040542500131 is an apocalyptic number.
30040542500131 is a deficient number, since it is larger than the sum of its proper divisors (68982782093).
30040542500131 is a wasteful number, since it uses less digits than its factorization.
30040542500131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24825221.
The product of its (nonzero) digits is 7200, while the sum is 28.
The spelling of 30040542500131 in words is "thirty trillion, forty billion, five hundred forty-two million, five hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •