Base | Representation |
---|---|
bin | 1101101111000001000000… |
… | …00001100010110010010100 |
3 | 10221221100120101111210110212 |
4 | 12313200200001202302110 |
5 | 12424320211302113022 |
6 | 144122541153304552 |
7 | 6235035143123156 |
oct | 667404001426224 |
9 | 127840511453425 |
10 | 30202747301012 |
11 | 9694a05516160 |
12 | 34795b2b65158 |
13 | 13b1150996910 |
14 | 765b6c294ad6 |
15 | 3759995283e2 |
hex | 1b7820062c94 |
30202747301012 has 48 divisors (see below), whose sum is σ = 62105833071744. Its totient is φ = 12670302960000.
The previous prime is 30202747300991. The next prime is 30202747301033. The reversal of 30202747301012 is 21010374720203.
It is an interprime number because it is at equal distance from previous prime (30202747300991) and next prime (30202747301033).
It is a self number, because there is not a number n which added to its sum of digits gives 30202747301012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1205864 + ... + 7865087.
It is an arithmetic number, because the mean of its divisors is an integer number (1293871522328).
Almost surely, 230202747301012 is an apocalyptic number.
It is an amenable number.
30202747301012 is an abundant number, since it is smaller than the sum of its proper divisors (31903085770732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30202747301012 is a wasteful number, since it uses less digits than its factorization.
30202747301012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9076800 (or 9076798 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 32.
The spelling of 30202747301012 in words is "thirty trillion, two hundred two billion, seven hundred forty-seven million, three hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •