Base | Representation |
---|---|
bin | 1101101111111001011000… |
… | …00000111001110110101101 |
3 | 10222001020200200012100020120 |
4 | 12313330230000321312231 |
5 | 12430314202341343041 |
6 | 144144504325235153 |
7 | 6240156152232156 |
oct | 667745400716655 |
9 | 128036620170216 |
10 | 30233013231021 |
11 | 96a6826883357 |
12 | 348343ab62ab9 |
13 | 13b3c6518b143 |
14 | 7673ddb6492d |
15 | 37666b681366 |
hex | 1b7f2c039dad |
30233013231021 has 8 divisors (see below), whose sum is σ = 40318859278944. Its totient is φ = 20151254668560.
The previous prime is 30233013231007. The next prime is 30233013231037. The reversal of 30233013231021 is 12013231033203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30233013231021 - 25 = 30233013230989 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30233013230982 and 30233013231000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30233013233021) 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, 1021854106 + ... + 1021883691.
It is an arithmetic number, because the mean of its divisors is an integer number (5039857409868).
Almost surely, 230233013231021 is an apocalyptic number.
It is an amenable number.
30233013231021 is a deficient number, since it is larger than the sum of its proper divisors (10085846047923).
30233013231021 is a wasteful number, since it uses less digits than its factorization.
30233013231021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2043742731.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 30233013231021 its reverse (12013231033203), we get a palindrome (42246244264224).
The spelling of 30233013231021 in words is "thirty trillion, two hundred thirty-three billion, thirteen million, two hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •