Base | Representation |
---|---|
bin | 101011111111011111011… |
… | …101110001010000101001 |
3 | 101201000011210221102202102 |
4 | 223333133131301100221 |
5 | 344012312422212301 |
6 | 10232444215143145 |
7 | 431261340432206 |
oct | 53773735612051 |
9 | 11630153842672 |
10 | 3023111132201 |
11 | a66104470436 |
12 | 409a95974ab5 |
13 | 18c10292c864 |
14 | a6468472cad |
15 | 539886a6b6b |
hex | 2bfdf771429 |
3023111132201 has 8 divisors (see below), whose sum is σ = 3089829464064. Its totient is φ = 2957063336640.
The previous prime is 3023111132141. The next prime is 3023111132227. The reversal of 3023111132201 is 1022311113203.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3023111132201 - 222 = 3023106937897 is a prime.
It is a super-2 number, since 2×30231111322012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3023111132801) 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, 167624960 + ... + 167642993.
It is an arithmetic number, because the mean of its divisors is an integer number (386228683008).
Almost surely, 23023111132201 is an apocalyptic number.
It is an amenable number.
3023111132201 is a deficient number, since it is larger than the sum of its proper divisors (66718331863).
3023111132201 is a wasteful number, since it uses less digits than its factorization.
3023111132201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 335268151.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3023111132201 its reverse (1022311113203), we get a palindrome (4045422245404).
The spelling of 3023111132201 in words is "three trillion, twenty-three billion, one hundred eleven million, one hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •