Base | Representation |
---|---|
bin | 10110010010011001… |
… | …011010101100011001 |
3 | 2021202210100101101121 |
4 | 112102121122230121 |
5 | 343002312113303 |
6 | 14554351445241 |
7 | 1505013625306 |
oct | 262231325431 |
9 | 67683311347 |
10 | 23930972953 |
11 | a1704571a8 |
12 | 477a526821 |
13 | 2344c0b634 |
14 | 12303cc0ad |
15 | 950e089bd |
hex | 59265ab19 |
23930972953 has 4 divisors (see below), whose sum is σ = 23944720228. Its totient is φ = 23917225680.
The previous prime is 23930972951. The next prime is 23930972959. The reversal of 23930972953 is 35927903932.
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 653978329 + 23276994624 = 25573^2 + 152568^2 .
It is a cyclic number.
It is not a de Polignac number, because 23930972953 - 21 = 23930972951 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23930972953.
It is not an unprimeable number, because it can be changed into a prime (23930972951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6871026 + ... + 6874507.
It is an arithmetic number, because the mean of its divisors is an integer number (5986180057).
Almost surely, 223930972953 is an apocalyptic number.
It is an amenable number.
23930972953 is a deficient number, since it is larger than the sum of its proper divisors (13747275).
23930972953 is a wasteful number, since it uses less digits than its factorization.
23930972953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13747274.
The product of its (nonzero) digits is 2755620, while the sum is 52.
The spelling of 23930972953 in words is "twenty-three billion, nine hundred thirty million, nine hundred seventy-two thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •