Base | Representation |
---|---|
bin | 1101101100011010010001… |
… | …00100011001011011001101 |
3 | 10221121210111222221222110202 |
4 | 12312031020210121123031 |
5 | 12421333400200310013 |
6 | 144013454531543245 |
7 | 6225415664000060 |
oct | 666151044313315 |
9 | 127553458858422 |
10 | 30113233213133 |
11 | 965aa5010a034 |
12 | 3464190a5ab25 |
13 | 13a5886736305 |
14 | 7616b9b228d7 |
15 | 3734aab80858 |
hex | 1b63489196cd |
30113233213133 has 32 divisors (see below), whose sum is σ = 35674279200000. Its totient is φ = 24870628339200.
The previous prime is 30113233213111. The next prime is 30113233213181. The reversal of 30113233213133 is 33131233231103.
It is a de Polignac number, because none of the positive numbers 2k-30113233213133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 30113233213096 and 30113233213105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30113233210133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 340222118 + ... + 340310616.
It is an arithmetic number, because the mean of its divisors is an integer number (1114821225000).
Almost surely, 230113233213133 is an apocalyptic number.
It is an amenable number.
30113233213133 is a deficient number, since it is larger than the sum of its proper divisors (5561045986867).
30113233213133 is a wasteful number, since it uses less digits than its factorization.
30113233213133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91925.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 30113233213133 its reverse (33131233231103), we get a palindrome (63244466444236).
The spelling of 30113233213133 in words is "thirty trillion, one hundred thirteen billion, two hundred thirty-three million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •