Base | Representation |
---|---|
bin | 11101111000011010110010… |
… | …100011101000111001011111 |
3 | 122020022200000222121222210100 |
4 | 131320122302203220321133 |
5 | 114211142442140310030 |
6 | 1143301411154512143 |
7 | 36452545102114602 |
oct | 3570326243507137 |
9 | 566280028558710 |
10 | 131420405010015 |
11 | 38969098561560 |
12 | 128a61a3895653 |
13 | 5843b77740784 |
14 | 2464ad279a339 |
15 | 102d82dcc7360 |
hex | 7786b28e8e5f |
131420405010015 has 48 divisors (see below), whose sum is σ = 254283202293120. Its totient is φ = 62237147394240.
The previous prime is 131420405009977. The next prime is 131420405010031. The reversal of 131420405010015 is 510010504024131.
131420405010015 is a `hidden beast` number, since 1 + 3 + 142 + 0 + 4 + 0 + 501 + 0 + 0 + 15 = 666.
It is not a de Polignac number, because 131420405010015 - 227 = 131420270792287 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3087138805 + ... + 3087181374.
It is an arithmetic number, because the mean of its divisors is an integer number (5297566714440).
Almost surely, 2131420405010015 is an apocalyptic number.
131420405010015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
131420405010015 is a deficient number, since it is larger than the sum of its proper divisors (122862797283105).
131420405010015 is a wasteful number, since it uses less digits than its factorization.
131420405010015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6174320244 (or 6174320241 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 131420405010015 its reverse (510010504024131), we get a palindrome (641430909034146).
The spelling of 131420405010015 in words is "one hundred thirty-one trillion, four hundred twenty billion, four hundred five million, ten thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •