Base | Representation |
---|---|
bin | 11101110100001100011011… |
… | …101011111011000010001010 |
3 | 122012021220201220021000002100 |
4 | 131310030123223323002022 |
5 | 114141413431404404002 |
6 | 1142520201423014230 |
7 | 36422560251626103 |
oct | 3564143353730212 |
9 | 565256656230070 |
10 | 131130111013002 |
11 | 38866a71125a32 |
12 | 12859a88a3a376 |
13 | 58226937239ca |
14 | 2454a3472b3aa |
15 | 1025edd7a111c |
hex | 77431bafb08a |
131130111013002 has 24 divisors (see below), whose sum is σ = 299068674240960. Its totient is φ = 41409508740840.
The previous prime is 131130111012973. The next prime is 131130111013049. The reversal of 131130111013002 is 200310111031131.
131130111013002 is a `hidden beast` number, since 1 + 311 + 30 + 11 + 10 + 1 + 300 + 2 = 666.
It is a super-2 number, since 2×1311301110130022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 191710688274 + ... + 191710688957.
It is an arithmetic number, because the mean of its divisors is an integer number (12461194760040).
Almost surely, 2131130111013002 is an apocalyptic number.
131130111013002 is an abundant number, since it is smaller than the sum of its proper divisors (167938563227958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131130111013002 is a wasteful number, since it uses less digits than its factorization.
131130111013002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383421377258 (or 383421377255 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 131130111013002 its reverse (200310111031131), we get a palindrome (331440222044133).
The spelling of 131130111013002 in words is "one hundred thirty-one trillion, one hundred thirty billion, one hundred eleven million, thirteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •