Base | Representation |
---|---|
bin | 1101111000101010011000… |
… | …10000111011001010011011 |
3 | 11000010001010001000201100111 |
4 | 12330111030100323022123 |
5 | 13000233021203343230 |
6 | 144535115130145151 |
7 | 6301010663516311 |
oct | 674251420731233 |
9 | 130101101021314 |
10 | 30534202012315 |
11 | 9802534013631 |
12 | 35118965821b7 |
13 | 1406494383a21 |
14 | 777c12b160b1 |
15 | 37e3e83b192a |
hex | 1bc54c43b29b |
30534202012315 has 8 divisors (see below), whose sum is σ = 36654648462288. Its totient is φ = 24418290911520.
The previous prime is 30534202012309. The next prime is 30534202012399. The reversal of 30534202012315 is 51321020243503.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30534202012315 - 213 = 30534202004123 is a prime.
It is a super-2 number, since 2×305342020123152 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1133822481 + ... + 1133849410.
It is an arithmetic number, because the mean of its divisors is an integer number (4581831057786).
Almost surely, 230534202012315 is an apocalyptic number.
30534202012315 is a deficient number, since it is larger than the sum of its proper divisors (6120446449973).
30534202012315 is a wasteful number, since it uses less digits than its factorization.
30534202012315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2267674589.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 30534202012315 its reverse (51321020243503), we get a palindrome (81855222255818).
The spelling of 30534202012315 in words is "thirty trillion, five hundred thirty-four billion, two hundred two million, twelve thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •