Base | Representation |
---|---|
bin | 1010011110111001110100… |
… | …11111000100001111100001 |
3 | 10000121202102102221102010100 |
4 | 11033130322133010033201 |
5 | 11010141120044400001 |
6 | 121005550341253013 |
7 | 4566312541644000 |
oct | 517347237041741 |
9 | 100552372842110 |
10 | 23052070700001 |
11 | 7388367a42382 |
12 | 270378ba04169 |
13 | cb2a54883015 |
14 | 599a248a4c37 |
15 | 29e985b4a586 |
hex | 14f73a7c43e1 |
23052070700001 has 96 divisors (see below), whose sum is σ = 40179170304000. Its totient is φ = 12717242667360.
The previous prime is 23052070699901. The next prime is 23052070700011. The reversal of 23052070700001 is 10000707025032.
23052070700001 is a `hidden beast` number, since 2 + 3 + 0 + 520 + 70 + 70 + 0 + 0 + 0 + 1 = 666.
It is not a de Polignac number, because 23052070700001 - 210 = 23052070698977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (23052070700011) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 39809590 + ... + 40384496.
It is an arithmetic number, because the mean of its divisors is an integer number (418533024000).
Almost surely, 223052070700001 is an apocalyptic number.
23052070700001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
23052070700001 is a deficient number, since it is larger than the sum of its proper divisors (17127099603999).
23052070700001 is a wasteful number, since it uses less digits than its factorization.
23052070700001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575384 (or 575367 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
Adding to 23052070700001 its reverse (10000707025032), we get a palindrome (33052777725033).
The spelling of 23052070700001 in words is "twenty-three trillion, fifty-two billion, seventy million, seven hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •