Base | Representation |
---|---|
bin | 1101101100101000111110… |
… | …10100001100001011110010 |
3 | 10221122112220102002211000220 |
4 | 12312110133110030023302 |
5 | 12422001034021031310 |
6 | 144021242341353510 |
7 | 6226115464235661 |
oct | 666243724141362 |
9 | 127575812084026 |
10 | 30121131033330 |
11 | 9663333237267 |
12 | 3465815a08896 |
13 | 13a6544a516bc |
14 | 761c289ccdd8 |
15 | 3737be1e5670 |
hex | 1b651f50c2f2 |
30121131033330 has 32 divisors (see below), whose sum is σ = 72457667662464. Its totient is φ = 8013751255296.
The previous prime is 30121131033317. The next prime is 30121131033349. The reversal of 30121131033330 is 3333013112103.
It is a self number, because there is not a number n which added to its sum of digits gives 30121131033330.
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 15 ways as a sum of consecutive naturals, for example, 1159383894 + ... + 1159409873.
It is an arithmetic number, because the mean of its divisors is an integer number (2264302114452).
Almost surely, 230121131033330 is an apocalyptic number.
30121131033330 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30121131033330 is an abundant number, since it is smaller than the sum of its proper divisors (42336536629134).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30121131033330 is a wasteful number, since it uses less digits than its factorization.
30121131033330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2318794210.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 30121131033330 its reverse (3333013112103), we get a palindrome (33454144145433).
The spelling of 30121131033330 in words is "thirty trillion, one hundred twenty-one billion, one hundred thirty-one million, thirty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •