Base | Representation |
---|---|
bin | 111100111111010100… |
… | …0111001000001010100 |
3 | 110112001210001200012211 |
4 | 1321332220321001110 |
5 | 4121213224324122 |
6 | 140100220123204 |
7 | 12314435542600 |
oct | 1717650710124 |
9 | 415053050184 |
10 | 130973667412 |
11 | 50600247945 |
12 | 21472996504 |
13 | c4738220b3 |
14 | 64a6920500 |
15 | 3618592877 |
hex | 1e7ea39054 |
130973667412 has 72 divisors (see below), whose sum is σ = 273778989120. Its totient is φ = 54643962240.
The previous prime is 130973667401. The next prime is 130973667421. The reversal of 130973667412 is 214766379031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1136112 + ... + 1246072.
It is an arithmetic number, because the mean of its divisors is an integer number (3802485960).
Almost surely, 2130973667412 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130973667412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136889494560).
130973667412 is an abundant number, since it is smaller than the sum of its proper divisors (142805321708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130973667412 is a wasteful number, since it uses less digits than its factorization.
130973667412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110141 (or 110132 counting only the distinct ones).
The product of its (nonzero) digits is 1143072, while the sum is 49.
The spelling of 130973667412 in words is "one hundred thirty billion, nine hundred seventy-three million, six hundred sixty-seven thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •