Base | Representation |
---|---|
bin | 1010100011111000011010… |
… | …10010000100111101101001 |
3 | 10001020002220112110112022010 |
4 | 11101330031102010331221 |
5 | 11020441412404342301 |
6 | 121220314440550133 |
7 | 4614546224421222 |
oct | 521741522047551 |
9 | 101202815415263 |
10 | 23223111012201 |
11 | 74439588174a1 |
12 | 2730964a82349 |
13 | cc5c121bcc49 |
14 | 5a400c780249 |
15 | 2a414698b5d6 |
hex | 151f0d484f69 |
23223111012201 has 8 divisors (see below), whose sum is σ = 31719371138784. Its totient is φ = 15104462446880.
The previous prime is 23223111012191. The next prime is 23223111012221. The reversal of 23223111012201 is 10221011132232.
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 23223111012201 - 242 = 18825064501097 is a prime.
It is a super-2 number, since 2×232231110122012 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (23223111012221) 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, 94402890171 + ... + 94402890416.
It is an arithmetic number, because the mean of its divisors is an integer number (3964921392348).
Almost surely, 223223111012201 is an apocalyptic number.
It is an amenable number.
23223111012201 is a deficient number, since it is larger than the sum of its proper divisors (8496260126583).
23223111012201 is a wasteful number, since it uses less digits than its factorization.
23223111012201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188805780631.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 23223111012201 its reverse (10221011132232), we get a palindrome (33444122144433).
The spelling of 23223111012201 in words is "twenty-three trillion, two hundred twenty-three billion, one hundred eleven million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •