Base | Representation |
---|---|
bin | 1001001101110010111001… |
… | …0100110011010111010000 |
3 | 1022212200000200001002002221 |
4 | 2103130232110303113100 |
5 | 2312003033343301324 |
6 | 33314504323350424 |
7 | 2064025253622412 |
oct | 223345624632720 |
9 | 38780020032087 |
10 | 10132605056464 |
11 | 3257239441680 |
12 | 1177924b22414 |
13 | 586667953687 |
14 | 2705c65949b2 |
15 | 12888b8350e4 |
hex | 9372e5335d0 |
10132605056464 has 20 divisors (see below), whose sum is σ = 21416642506080. Its totient is φ = 4605729571040.
The previous prime is 10132605056359. The next prime is 10132605056507. The reversal of 10132605056464 is 46465050623101.
10132605056464 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 10132605056464.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28785809644 + ... + 28785809995.
It is an arithmetic number, because the mean of its divisors is an integer number (1070832125304).
Almost surely, 210132605056464 is an apocalyptic number.
It is an amenable number.
10132605056464 is an abundant number, since it is smaller than the sum of its proper divisors (11284037449616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10132605056464 is a wasteful number, since it uses less digits than its factorization.
10132605056464 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57571619658 (or 57571619652 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 43.
Adding to 10132605056464 its reverse (46465050623101), we get a palindrome (56597655679565).
The spelling of 10132605056464 in words is "ten trillion, one hundred thirty-two billion, six hundred five million, fifty-six thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •