Base | Representation |
---|---|
bin | 1101110000001101111000… |
… | …00100111001110100000011 |
3 | 10222002022002202121220101101 |
4 | 12320012330010321310003 |
5 | 12431004223123224443 |
6 | 144153524441315231 |
7 | 6241026004322566 |
oct | 670067404716403 |
9 | 128068082556341 |
10 | 30244020133123 |
11 | 97004649a5865 |
12 | 34855b1195b17 |
13 | 13b4cca661274 |
14 | 767b659104dd |
15 | 376ab2b3584d |
hex | 1b81bc139d03 |
30244020133123 has 8 divisors (see below), whose sum is σ = 30706477054992. Its totient is φ = 29781888318336.
The previous prime is 30244020133109. The next prime is 30244020133133. The reversal of 30244020133123 is 32133102044203.
It is a happy number.
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 30244020133123 - 225 = 30243986578691 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30244020133091 and 30244020133100.
It is not an unprimeable number, because it can be changed into a prime (30244020133133) 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, 81089290 + ... + 81461407.
It is an arithmetic number, because the mean of its divisors is an integer number (3838309631874).
Almost surely, 230244020133123 is an apocalyptic number.
30244020133123 is a deficient number, since it is larger than the sum of its proper divisors (462456921869).
30244020133123 is a wasteful number, since it uses less digits than its factorization.
30244020133123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162553541.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 30244020133123 its reverse (32133102044203), we get a palindrome (62377122177326).
The spelling of 30244020133123 in words is "thirty trillion, two hundred forty-four billion, twenty million, one hundred thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •