Base | Representation |
---|---|
bin | 1101101001110010001101… |
… | …11010000010111000101101 |
3 | 10221022011122020222201010110 |
4 | 12310321012322002320231 |
5 | 12413344111310122313 |
6 | 143504214133130233 |
7 | 6216043126005102 |
oct | 664710672027055 |
9 | 127264566881113 |
10 | 30023011020333 |
11 | 9625762028231 |
12 | 344a7b1789979 |
13 | 139a208889506 |
14 | 75b19b506aa9 |
15 | 370e7a063ec3 |
hex | 1b4e46e82e2d |
30023011020333 has 8 divisors (see below), whose sum is σ = 40196783773696. Its totient is φ = 19932289473600.
The previous prime is 30023011020283. The next prime is 30023011020377. The reversal of 30023011020333 is 33302011032003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30023011020333 - 226 = 30022943911469 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30023011090333) by changing a digit.
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, 20762800813 + ... + 20762802258.
It is an arithmetic number, because the mean of its divisors is an integer number (5024597971712).
Almost surely, 230023011020333 is an apocalyptic number.
It is an amenable number.
30023011020333 is a deficient number, since it is larger than the sum of its proper divisors (10173772753363).
30023011020333 is a wasteful number, since it uses less digits than its factorization.
30023011020333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41525603315.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30023011020333 its reverse (33302011032003), we get a palindrome (63325022052336).
The spelling of 30023011020333 in words is "thirty trillion, twenty-three billion, eleven million, twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •