Base | Representation |
---|---|
bin | 1001001110001111011000… |
… | …1001101110010000010100 |
3 | 1022220101202122011122010110 |
4 | 2103203312021232100110 |
5 | 2312114214123444302 |
6 | 33322211232123020 |
7 | 2064415624430265 |
oct | 223436611562024 |
9 | 38811678148113 |
10 | 10140252562452 |
11 | 325a503241061 |
12 | 11792ba096470 |
13 | 5872b614934c |
14 | 270b1010296c |
15 | 128b87e02b6c |
hex | 938f626e414 |
10140252562452 has 48 divisors (see below), whose sum is σ = 23681360973312. Its totient is φ = 3377117541600.
The previous prime is 10140252562367. The next prime is 10140252562499. The reversal of 10140252562452 is 25426525204101.
It is a self number, because there is not a number n which added to its sum of digits gives 10140252562452.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 122184723 + ... + 122267685.
It is an arithmetic number, because the mean of its divisors is an integer number (493361686944).
Almost surely, 210140252562452 is an apocalyptic number.
10140252562452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10140252562452 is an abundant number, since it is smaller than the sum of its proper divisors (13541108410860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10140252562452 is a wasteful number, since it uses less digits than its factorization.
10140252562452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91788 (or 91786 counting only the distinct ones).
The product of its (nonzero) digits is 192000, while the sum is 39.
Adding to 10140252562452 its reverse (25426525204101), we get a palindrome (35566777766553).
The spelling of 10140252562452 in words is "ten trillion, one hundred forty billion, two hundred fifty-two million, five hundred sixty-two thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •