Base | Representation |
---|---|
bin | 1101110001111010011011… |
… | …10101110000101101000000 |
3 | 10222021212112101212122221110 |
4 | 12320331031311300231000 |
5 | 12432433102323241112 |
6 | 144240403505523320 |
7 | 6245161150655232 |
oct | 670751565605500 |
9 | 128255471778843 |
10 | 30302300212032 |
11 | 9723151543732 |
12 | 3494957043540 |
13 | 13ba657988664 |
14 | 76a8d3bb4252 |
15 | 37837439c13c |
hex | 1b8f4dd70b40 |
30302300212032 has 28 divisors (see below), whose sum is σ = 80174835978176. Its totient is φ = 10100766737280.
The previous prime is 30302300211973. The next prime is 30302300212111. The reversal of 30302300212032 is 23021200320303.
It is a super-2 number, since 2×303023002120322 (a number of 28 digits) contains 22 as substring.
It is a congruent 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 3 ways as a sum of consecutive naturals, for example, 78912239944 + ... + 78912240327.
Almost surely, 230302300212032 is an apocalyptic number.
30302300212032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30302300212032 is an abundant number, since it is smaller than the sum of its proper divisors (49872535766144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30302300212032 is a wasteful number, since it uses less digits than its factorization.
30302300212032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157824480286 (or 157824480276 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 30302300212032 its reverse (23021200320303), we get a palindrome (53323500532335).
The spelling of 30302300212032 in words is "thirty trillion, three hundred two billion, three hundred million, two hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •