Base | Representation |
---|---|
bin | 1011110110100000101000… |
… | …0101100010101011111110 |
3 | 1201010202112202122021101012 |
4 | 2331220022011202223332 |
5 | 3202000143100013042 |
6 | 43414223225315222 |
7 | 2513315543266325 |
oct | 275501205425376 |
9 | 51122482567335 |
10 | 13031100001022 |
11 | 4174505259884 |
12 | 1565621035b12 |
13 | 736a9ac0179c |
14 | 3309cc5ad0bc |
15 | 178e7eb46e82 |
hex | bda0a162afe |
13031100001022 has 48 divisors (see below), whose sum is σ = 20436307267200. Its totient is φ = 6230271453120.
The previous prime is 13031100001021. The next prime is 13031100001027. The reversal of 13031100001022 is 22010000113031.
It is a junction number, because it is equal to n+sod(n) for n = 13031100000988 and 13031100001006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031100001021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44680193 + ... + 44970899.
It is an arithmetic number, because the mean of its divisors is an integer number (425756401400).
Almost surely, 213031100001022 is an apocalyptic number.
13031100001022 is a deficient number, since it is larger than the sum of its proper divisors (7405207266178).
13031100001022 is a wasteful number, since it uses less digits than its factorization.
13031100001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291057 (or 291016 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 13031100001022 its reverse (22010000113031), we get a palindrome (35041100114053).
The spelling of 13031100001022 in words is "thirteen trillion, thirty-one billion, one hundred million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •