Base | Representation |
---|---|
bin | 1010100001110100100101… |
… | …00011100111011001101101 |
3 | 10000222100012212021101000121 |
4 | 11100322102203213121231 |
5 | 11013311434112113110 |
6 | 121124011300324541 |
7 | 4606462245330013 |
oct | 520722243473155 |
9 | 100870185241017 |
10 | 23152332535405 |
11 | 7416938155277 |
12 | 271b0b13a3751 |
13 | cbc3426ba248 |
14 | 5a08166028b3 |
15 | 2a23a2d55cda |
hex | 150e928e766d |
23152332535405 has 4 divisors (see below), whose sum is σ = 27782799042492. Its totient is φ = 18521866028320.
The previous prime is 23152332535393. The next prime is 23152332535457. The reversal of 23152332535405 is 50453523325132.
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 13722483045769 + 9429849489636 = 3704387^2 + 3070806^2 .
It is not a de Polignac number, because 23152332535405 - 223 = 23152324146797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2315233253536 + ... + 2315233253545.
It is an arithmetic number, because the mean of its divisors is an integer number (6945699760623).
Almost surely, 223152332535405 is an apocalyptic number.
It is an amenable number.
23152332535405 is a deficient number, since it is larger than the sum of its proper divisors (4630466507087).
23152332535405 is an equidigital number, since it uses as much as digits as its factorization.
23152332535405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4630466507086.
The product of its (nonzero) digits is 1620000, while the sum is 43.
The spelling of 23152332535405 in words is "twenty-three trillion, one hundred fifty-two billion, three hundred thirty-two million, five hundred thirty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •