Base | Representation |
---|---|
bin | 1010100000010101011101… |
… | …10101101000111111101101 |
3 | 10000210110102001020110220122 |
4 | 11100022232311220333231 |
5 | 11011442343424240041 |
6 | 121044324205454325 |
7 | 4603003641062015 |
oct | 520125665507755 |
9 | 100713361213818 |
10 | 23101267415021 |
11 | 73a7213230544 |
12 | 271121b8713a5 |
13 | cb759508c893 |
14 | 59c170652c45 |
15 | 2a0db4c19c4b |
hex | 1502aed68fed |
23101267415021 has 4 divisors (see below), whose sum is σ = 23101327236000. Its totient is φ = 23101207594044.
The previous prime is 23101267414993. The next prime is 23101267415027. The reversal of 23101267415021 is 12051476210132.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23101267415021 - 26 = 23101267414957 is a prime.
It is a super-2 number, since 2×231012674150212 (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 (23101267415027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29327441 + ... + 30104838.
It is an arithmetic number, because the mean of its divisors is an integer number (5775331809000).
Almost surely, 223101267415021 is an apocalyptic number.
It is an amenable number.
23101267415021 is a deficient number, since it is larger than the sum of its proper divisors (59820979).
23101267415021 is an equidigital number, since it uses as much as digits as its factorization.
23101267415021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59820978.
The product of its (nonzero) digits is 20160, while the sum is 35.
The spelling of 23101267415021 in words is "twenty-three trillion, one hundred one billion, two hundred sixty-seven million, four hundred fifteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •