Base | Representation |
---|---|
bin | 1101110010001010101011… |
… | …00101111111011001000101 |
3 | 10222022201001010010111002210 |
4 | 12321011111211333121011 |
5 | 12433103432134331323 |
6 | 144244405050054033 |
7 | 6245620223622612 |
oct | 671052545773105 |
9 | 128281033114083 |
10 | 30311020230213 |
11 | 9726916793428 |
12 | 349658b41a319 |
13 | 13bb417429628 |
14 | 76b0bdd47509 |
15 | 3786d4bc1293 |
hex | 1b915597f645 |
30311020230213 has 8 divisors (see below), whose sum is σ = 40414756132800. Its totient is φ = 20207315573888.
The previous prime is 30311020230167. The next prime is 30311020230241. The reversal of 30311020230213 is 31203202011303.
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 30311020230213 - 229 = 30310483359301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30311020230213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30311020230013) 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, 5445708 + ... + 9501461.
It is an arithmetic number, because the mean of its divisors is an integer number (5051844516600).
Almost surely, 230311020230213 is an apocalyptic number.
It is an amenable number.
30311020230213 is a deficient number, since it is larger than the sum of its proper divisors (10103735902587).
30311020230213 is a wasteful number, since it uses less digits than its factorization.
30311020230213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15623131.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 30311020230213 its reverse (31203202011303), we get a palindrome (61514222241516).
The spelling of 30311020230213 in words is "thirty trillion, three hundred eleven billion, twenty million, two hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •