Base | Representation |
---|---|
bin | 1101101010000011001001… |
… | …10001011011000110100101 |
3 | 10221100001002211021220021122 |
4 | 12311001210301123012211 |
5 | 12414021221103330201 |
6 | 143512320204423325 |
7 | 6216514325106665 |
oct | 665014461330645 |
9 | 127301084256248 |
10 | 30032102011301 |
11 | 96295a7717305 |
12 | 345050a247b45 |
13 | 139b027147800 |
14 | 75b7c0a461a5 |
15 | 37130d215e1b |
hex | 1b5064c5b1a5 |
30032102011301 has 12 divisors (see below), whose sum is σ = 33276246794208. Its totient is φ = 27077244025104.
The previous prime is 30032102011291. The next prime is 30032102011321. The reversal of 30032102011301 is 10311020123003.
It is not a de Polignac number, because 30032102011301 - 218 = 30032101749157 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30032102011301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30032102011321) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2066326985 + ... + 2066341518.
It is an arithmetic number, because the mean of its divisors is an integer number (2773020566184).
Almost surely, 230032102011301 is an apocalyptic number.
It is an amenable number.
30032102011301 is a deficient number, since it is larger than the sum of its proper divisors (3244144782907).
30032102011301 is a wasteful number, since it uses less digits than its factorization.
30032102011301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4132668572 (or 4132668559 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 30032102011301 its reverse (10311020123003), we get a palindrome (40343122134304).
The spelling of 30032102011301 in words is "thirty trillion, thirty-two billion, one hundred two million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •