Base | Representation |
---|---|
bin | 1101101111111001100011… |
… | …11101100000010001011101 |
3 | 10222001020221121221021210210 |
4 | 12313330301331200101131 |
5 | 12430314403412044401 |
6 | 144144522251523033 |
7 | 6240161503254651 |
oct | 667746175402135 |
9 | 128036847837723 |
10 | 30233113003101 |
11 | 96a6878129618 |
12 | 3483468459479 |
13 | 13b3c7ca51c88 |
14 | 76740d0d6a61 |
15 | 3766752dd4d6 |
hex | 1b7f31f6045d |
30233113003101 has 8 divisors (see below), whose sum is σ = 40311510827104. Its totient is φ = 20155061923920.
The previous prime is 30233113003063. The next prime is 30233113003187. The reversal of 30233113003101 is 10130031133203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30233113003101 - 27 = 30233113002973 is a prime.
It is a super-2 number, since 2×302331130031012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30233113008101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86482690 + ... + 86831571.
It is an arithmetic number, because the mean of its divisors is an integer number (5038938853388).
Almost surely, 230233113003101 is an apocalyptic number.
It is an amenable number.
30233113003101 is a deficient number, since it is larger than the sum of its proper divisors (10078397824003).
30233113003101 is a wasteful number, since it uses less digits than its factorization.
30233113003101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173372411.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 30233113003101 its reverse (10130031133203), we get a palindrome (40363144136304).
The spelling of 30233113003101 in words is "thirty trillion, two hundred thirty-three billion, one hundred thirteen million, three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.404 sec. • engine limits •