Base | Representation |
---|---|
bin | 1010011110010011001010… |
… | …01111010011100011100001 |
3 | 10000112202211210221201200120 |
4 | 11033021211033103203201 |
5 | 11004321112131332400 |
6 | 120552234511110453 |
7 | 4564646260464000 |
oct | 517114517234341 |
9 | 100482753851616 |
10 | 23031313152225 |
11 | 737a585938514 |
12 | 26bb758212429 |
13 | cb0ac726a281 |
14 | 598a15b44c37 |
15 | 29e16d640ca0 |
hex | 14f2653d38e1 |
23031313152225 has 48 divisors (see below), whose sum is σ = 44406341443200. Its totient is φ = 10528600286400.
The previous prime is 23031313152191. The next prime is 23031313152299. The reversal of 23031313152225 is 52225131313032.
It is not a de Polignac number, because 23031313152225 - 27 = 23031313152097 is a prime.
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 47 ways as a sum of consecutive naturals, for example, 447618846 + ... + 447670295.
It is an arithmetic number, because the mean of its divisors is an integer number (925132113400).
Almost surely, 223031313152225 is an apocalyptic number.
23031313152225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
23031313152225 is a deficient number, since it is larger than the sum of its proper divisors (21375028290975).
23031313152225 is an equidigital number, since it uses as much as digits as its factorization.
23031313152225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 895289175 (or 895289156 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 33.
Adding to 23031313152225 its reverse (52225131313032), we get a palindrome (75256444465257).
The spelling of 23031313152225 in words is "twenty-three trillion, thirty-one billion, three hundred thirteen million, one hundred fifty-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •