Base | Representation |
---|---|
bin | 1101101111010000101111… |
… | …11110000111100101001101 |
3 | 10221222011101121202002202100 |
4 | 12313220113332013211031 |
5 | 12424440020220320023 |
6 | 144130500141345313 |
7 | 6235454515653225 |
oct | 667502776074515 |
9 | 127864347662670 |
10 | 30211202120013 |
11 | 9698553aa0882 |
12 | 347b172568239 |
13 | 13b1b9a502cb5 |
14 | 766331113085 |
15 | 375ce1914c43 |
hex | 1b7a17f8794d |
30211202120013 has 12 divisors (see below), whose sum is σ = 44702754356988. Its totient is φ = 19649562354240.
The previous prime is 30211202119981. The next prime is 30211202120089. The reversal of 30211202120013 is 31002120211203.
It can be written as a sum of positive squares in 2 ways, for example, as 382105713609 + 29829096406404 = 618147^2 + 5461602^2 .
It is not a de Polignac number, because 30211202120013 - 25 = 30211202119981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30211202120213) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40936587870 + ... + 40936588607.
It is an arithmetic number, because the mean of its divisors is an integer number (3725229529749).
Almost surely, 230211202120013 is an apocalyptic number.
It is an amenable number.
30211202120013 is a deficient number, since it is larger than the sum of its proper divisors (14491552236975).
30211202120013 is a wasteful number, since it uses less digits than its factorization.
30211202120013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81873176524 (or 81873176521 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 30211202120013 its reverse (31002120211203), we get a palindrome (61213322331216).
The spelling of 30211202120013 in words is "thirty trillion, two hundred eleven billion, two hundred two million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •