Base | Representation |
---|---|
bin | 1010100000111010010010… |
… | …11011111000101000101101 |
3 | 10000212100110002201201112002 |
4 | 11100131021123320220231 |
5 | 11012303342444013010 |
6 | 121101354250222045 |
7 | 4604303643556523 |
oct | 520351133705055 |
9 | 100770402651462 |
10 | 23121041001005 |
11 | 740463a976342 |
12 | 2715019a24925 |
13 | cb93c689250c |
14 | 59d0c883c313 |
15 | 2a1670b601a5 |
hex | 1507496f8a2d |
23121041001005 has 8 divisors (see below), whose sum is σ = 27745277515872. Its totient is φ = 18496813924368.
The previous prime is 23121041000989. The next prime is 23121041001007. The reversal of 23121041001005 is 50010014012132.
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 23121041001005 - 24 = 23121041000989 is a prime.
It is a super-2 number, since 2×231210410010052 (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 (23121041001007) 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, 5276222 + ... + 8607008.
It is an arithmetic number, because the mean of its divisors is an integer number (3468159689484).
Almost surely, 223121041001005 is an apocalyptic number.
It is an amenable number.
23121041001005 is a deficient number, since it is larger than the sum of its proper divisors (4624236514867).
23121041001005 is a wasteful number, since it uses less digits than its factorization.
23121041001005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4719115.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 23121041001005 its reverse (50010014012132), we get a palindrome (73131055013137).
The spelling of 23121041001005 in words is "twenty-three trillion, one hundred twenty-one billion, forty-one million, one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •