Base | Representation |
---|---|
bin | 1010100001001110101111… |
… | …11101100001111101101101 |
3 | 10000220101210101122101022011 |
4 | 11100213113331201331231 |
5 | 11012443340130322201 |
6 | 121110412041521221 |
7 | 4605143033544553 |
oct | 520472775417555 |
9 | 100811711571264 |
10 | 23132022120301 |
11 | 7409265488846 |
12 | 27171834a3211 |
13 | cba456909043 |
14 | 59d84add5bd3 |
15 | 2a1ab4c20151 |
hex | 1509d7f61f6d |
23132022120301 has 4 divisors (see below), whose sum is σ = 24137762212512. Its totient is φ = 22126282028092.
The previous prime is 23132022120289. The next prime is 23132022120343. The reversal of 23132022120301 is 10302122023132.
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 23132022120301 - 25 = 23132022120269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23132022124301) 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, 502870046071 + ... + 502870046116.
It is an arithmetic number, because the mean of its divisors is an integer number (6034440553128).
Almost surely, 223132022120301 is an apocalyptic number.
It is an amenable number.
23132022120301 is a deficient number, since it is larger than the sum of its proper divisors (1005740092211).
23132022120301 is a wasteful number, since it uses less digits than its factorization.
23132022120301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005740092210.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 23132022120301 its reverse (10302122023132), we get a palindrome (33434144143433).
The spelling of 23132022120301 in words is "twenty-three trillion, one hundred thirty-two billion, twenty-two million, one hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •