Base | Representation |
---|---|
bin | 1010100110110001001101… |
… | …10010100010101110000101 |
3 | 10001120120222210200220121112 |
4 | 11103120212302202232011 |
5 | 11024103104214412101 |
6 | 121334043302254405 |
7 | 4624660624206614 |
oct | 523304662425605 |
9 | 101516883626545 |
10 | 23322323200901 |
11 | 7481a3a48727a |
12 | 2748032a27405 |
13 | 100239372664a |
14 | 5a8b40d2987b |
15 | 2a6a0195a6bb |
hex | 153626ca2b85 |
23322323200901 has 4 divisors (see below), whose sum is σ = 23492559136812. Its totient is φ = 23152087264992.
The previous prime is 23322323200859. The next prime is 23322323200933. The reversal of 23322323200901 is 10900232322332.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 16832434480225 + 6489888720676 = 4102735^2 + 2547526^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23322323200901 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 (23322322200901) 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, 85117967750 + ... + 85117968023.
It is an arithmetic number, because the mean of its divisors is an integer number (5873139784203).
Almost surely, 223322323200901 is an apocalyptic number.
It is an amenable number.
23322323200901 is a deficient number, since it is larger than the sum of its proper divisors (170235935911).
23322323200901 is a wasteful number, since it uses less digits than its factorization.
23322323200901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170235935910.
The product of its (nonzero) digits is 23328, while the sum is 32.
The spelling of 23322323200901 in words is "twenty-three trillion, three hundred twenty-two billion, three hundred twenty-three million, two hundred thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •