Base | Representation |
---|---|
bin | 101011111111100000100… |
… | …110111011100101101101 |
3 | 101201000020011000211011002 |
4 | 223333200212323211231 |
5 | 344012332324423041 |
6 | 10232450142210045 |
7 | 431261662441142 |
oct | 53774046734555 |
9 | 11630204024132 |
10 | 3023130311021 |
11 | a6611427a7a7 |
12 | 409aa0283925 |
13 | 18c1068b6282 |
14 | a646ac263c9 |
15 | 5398a1e459b |
hex | 2bfe09bb96d |
3023130311021 has 8 divisors (see below), whose sum is σ = 3025453691904. Its totient is φ = 3020807571840.
The previous prime is 3023130311011. The next prime is 3023130311041. The reversal of 3023130311021 is 1201130313203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3023130311021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3023130310984 and 3023130311002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3023130311011) 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, 9487316 + ... + 9800786.
It is an arithmetic number, because the mean of its divisors is an integer number (378181711488).
Almost surely, 23023130311021 is an apocalyptic number.
It is an amenable number.
3023130311021 is a deficient number, since it is larger than the sum of its proper divisors (2323380883).
3023130311021 is a wasteful number, since it uses less digits than its factorization.
3023130311021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320851.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 3023130311021 its reverse (1201130313203), we get a palindrome (4224260624224).
The spelling of 3023130311021 in words is "three trillion, twenty-three billion, one hundred thirty million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •