Base | Representation |
---|---|
bin | 1001100011110110100101… |
… | …1100010110001110010100 |
3 | 1101012220011021100120222012 |
4 | 2120331221130112032110 |
5 | 2334210130311341202 |
6 | 34204535150523352 |
7 | 2133302051611202 |
oct | 230755134261624 |
9 | 41186137316865 |
10 | 10511554012052 |
11 | 3392a1a227805 |
12 | 1219262206558 |
13 | 5b3309c17302 |
14 | 284a94a38072 |
15 | 13366a09c152 |
hex | 98f69716394 |
10511554012052 has 6 divisors (see below), whose sum is σ = 18395219521098. Its totient is φ = 5255777006024.
The previous prime is 10511554012031. The next prime is 10511554012111. The reversal of 10511554012052 is 25021045511501.
10511554012052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 9929027873296 + 582526138756 = 3151036^2 + 763234^2 .
It is a super-2 number, since 2×105115540120522 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1313944251503 + ... + 1313944251510.
It is an arithmetic number, because the mean of its divisors is an integer number (3065869920183).
Almost surely, 210511554012052 is an apocalyptic number.
It is an amenable number.
10511554012052 is a deficient number, since it is larger than the sum of its proper divisors (7883665509046).
10511554012052 is a wasteful number, since it uses less digits than its factorization.
10511554012052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2627888503017 (or 2627888503015 counting only the distinct ones).
The product of its (nonzero) digits is 10000, while the sum is 32.
Adding to 10511554012052 its reverse (25021045511501), we get a palindrome (35532599523553).
The spelling of 10511554012052 in words is "ten trillion, five hundred eleven billion, five hundred fifty-four million, twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •