Base | Representation |
---|---|
bin | 11101110010100110000101… |
… | …111010111111110101000100 |
3 | 122011220102002200211112002110 |
4 | 131302212011322333311010 |
5 | 114133113404343400004 |
6 | 1142353505435141020 |
7 | 36411620203262646 |
oct | 3562460572776504 |
9 | 564812080745073 |
10 | 131020224200004 |
11 | 388244019639a7 |
12 | 1284071bba4770 |
13 | 5815200806979 |
14 | 244d5ac5ac896 |
15 | 102320b5b5589 |
hex | 772985ebfd44 |
131020224200004 has 12 divisors (see below), whose sum is σ = 305713856466704. Its totient is φ = 43673408066664.
The previous prime is 131020224200003. The next prime is 131020224200023. The reversal of 131020224200004 is 400002422020131.
131020224200004 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is not an unprimeable number, because it can be changed into a prime (131020224200003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5459176008322 + ... + 5459176008345.
Almost surely, 2131020224200004 is an apocalyptic number.
It is an amenable number.
131020224200004 is an abundant number, since it is smaller than the sum of its proper divisors (174693632266700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131020224200004 is a wasteful number, since it uses less digits than its factorization.
131020224200004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10918352016674 (or 10918352016672 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 131020224200004 its reverse (400002422020131), we get a palindrome (531022646220135).
The spelling of 131020224200004 in words is "one hundred thirty-one trillion, twenty billion, two hundred twenty-four million, two hundred thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •