Base | Representation |
---|---|
bin | 1010011111000000010000… |
… | …00101001001011100010100 |
3 | 10000122002022211102121201112 |
4 | 11033200020011021130110 |
5 | 11010220201110341202 |
6 | 121011320520114152 |
7 | 4566464164422233 |
oct | 517401005113424 |
9 | 100562284377645 |
10 | 23055520012052 |
11 | 7389877a995a0 |
12 | 2704393005958 |
13 | cb3184383078 |
14 | 599c70a2ab1a |
15 | 29ead8893b52 |
hex | 14f808149714 |
23055520012052 has 24 divisors (see below), whose sum is σ = 44761102031520. Its totient is φ = 10302158401760.
The previous prime is 23055520012033. The next prime is 23055520012123. The reversal of 23055520012052 is 25021002555032.
It is a super-2 number, since 2×230555200120522 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4440582923 + ... + 4440588114.
It is an arithmetic number, because the mean of its divisors is an integer number (1865045917980).
Almost surely, 223055520012052 is an apocalyptic number.
23055520012052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23055520012052 is a deficient number, since it is larger than the sum of its proper divisors (21705582019468).
23055520012052 is a wasteful number, since it uses less digits than its factorization.
23055520012052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8881171111 (or 8881171109 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 32.
Adding to 23055520012052 its reverse (25021002555032), we get a palindrome (48076522567084).
The spelling of 23055520012052 in words is "twenty-three trillion, fifty-five billion, five hundred twenty million, twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •