Base | Representation |
---|---|
bin | 1101111100000110111110… |
… | …01000110001110100110101 |
3 | 11000112100210111122020222010 |
4 | 12332003133020301310311 |
5 | 13004203041320312121 |
6 | 145105342434154433 |
7 | 6312402516055605 |
oct | 676033710616465 |
9 | 130470714566863 |
10 | 30652630244661 |
11 | 984878672a417 |
12 | 3530827a22a19 |
13 | 14146b8a3b859 |
14 | 77d8493d6c05 |
15 | 38252a393376 |
hex | 1be0df231d35 |
30652630244661 has 16 divisors (see below), whose sum is σ = 41275482612480. Its totient is φ = 20232438763200.
The previous prime is 30652630244633. The next prime is 30652630244689. The reversal of 30652630244661 is 16644203625603.
It is an interprime number because it is at equal distance from previous prime (30652630244633) and next prime (30652630244689).
It is not a de Polignac number, because 30652630244661 - 25 = 30652630244629 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 30652630244661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30652630244261) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19180951 + ... + 20717483.
It is an arithmetic number, because the mean of its divisors is an integer number (2579717663280).
Almost surely, 230652630244661 is an apocalyptic number.
It is an amenable number.
30652630244661 is a deficient number, since it is larger than the sum of its proper divisors (10622852367819).
30652630244661 is a wasteful number, since it uses less digits than its factorization.
30652630244661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1602476.
The product of its (nonzero) digits is 3732480, while the sum is 48.
The spelling of 30652630244661 in words is "thirty trillion, six hundred fifty-two billion, six hundred thirty million, two hundred forty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •