Base | Representation |
---|---|
bin | 1101110010001010101011… |
… | …10000111100000011010001 |
3 | 10222022201001022112021212101 |
4 | 12321011111300330003101 |
5 | 12433103433403200423 |
6 | 144244405231400401 |
7 | 6245620260204640 |
oct | 671052560740321 |
9 | 128281038467771 |
10 | 30311023100113 |
11 | 9726918373648 |
12 | 3496590383101 |
13 | 13bb417bc29b2 |
14 | 76b0c0493357 |
15 | 3786d508b7ad |
hex | 1b9155c3c0d1 |
30311023100113 has 8 divisors (see below), whose sum is σ = 34977491289728. Its totient is φ = 25728635418624.
The previous prime is 30311023100107. The next prime is 30311023100143. The reversal of 30311023100113 is 31100132011303.
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 30311023100113 - 217 = 30311022969041 is a prime.
It is a super-2 number, since 2×303110231001132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30311023100143) 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, 21020126256 + ... + 21020127697.
It is an arithmetic number, because the mean of its divisors is an integer number (4372186411216).
Almost surely, 230311023100113 is an apocalyptic number.
It is an amenable number.
30311023100113 is a deficient number, since it is larger than the sum of its proper divisors (4666468189615).
30311023100113 is a wasteful number, since it uses less digits than its factorization.
30311023100113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42040254063.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30311023100113 its reverse (31100132011303), we get a palindrome (61411155111416).
The spelling of 30311023100113 in words is "thirty trillion, three hundred eleven billion, twenty-three million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •