Base | Representation |
---|---|
bin | 10101011011100101… |
… | …101110100110100001 |
3 | 2012101201002221121211 |
4 | 111123211232212201 |
5 | 334111413001340 |
6 | 14323223150121 |
7 | 1443150061156 |
oct | 253345564641 |
9 | 65351087554 |
10 | 23011453345 |
11 | 9839402541 |
12 | 45625a5341 |
13 | 222956c3aa |
14 | 118423022d |
15 | 8ea3235ea |
hex | 55b96e9a1 |
23011453345 has 8 divisors (see below), whose sum is σ = 28134758376. Its totient is φ = 18061819776.
The previous prime is 23011453303. The next prime is 23011453417. The reversal of 23011453345 is 54335411032.
It can be written as a sum of positive squares in 4 ways, for example, as 1663905681 + 21347547664 = 40791^2 + 146108^2 .
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 23011453345 - 27 = 23011453217 is a prime.
It is a super-2 number, since 2×230114533452 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43417572 + ... + 43418101.
It is an arithmetic number, because the mean of its divisors is an integer number (3516844797).
Almost surely, 223011453345 is an apocalyptic number.
It is an amenable number.
23011453345 is a deficient number, since it is larger than the sum of its proper divisors (5123305031).
23011453345 is an equidigital number, since it uses as much as digits as its factorization.
23011453345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86835731.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 23011453345 its reverse (54335411032), we get a palindrome (77346864377).
The spelling of 23011453345 in words is "twenty-three billion, eleven million, four hundred fifty-three thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •