Base | Representation |
---|---|
bin | 111101000000011111… |
… | …1101111011111011001 |
3 | 110112011112110202100200 |
4 | 1322000333233133121 |
5 | 4121303340241441 |
6 | 140104151452413 |
7 | 12315425633361 |
oct | 1720077573731 |
9 | 415145422320 |
10 | 131013212121 |
11 | 506205a7420 |
12 | 21484087109 |
13 | c47ba8962c |
14 | 64abc959a1 |
15 | 361bca47b6 |
hex | 1e80fef7d9 |
131013212121 has 24 divisors (see below), whose sum is σ = 206561125056. Its totient is φ = 79357307040.
The previous prime is 131013212117. The next prime is 131013212131. The reversal of 131013212121 is 121212310131.
131013212121 is a `hidden beast` number, since 131 + 0 + 1 + 321 + 212 + 1 = 666.
It is not a de Polignac number, because 131013212121 - 22 = 131013212117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131013212094 and 131013212103.
It is not an unprimeable number, because it can be changed into a prime (131013212131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 194590 + ... + 547623.
It is an arithmetic number, because the mean of its divisors is an integer number (8606713544).
Almost surely, 2131013212121 is an apocalyptic number.
131013212121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131013212121 is a deficient number, since it is larger than the sum of its proper divisors (75547912935).
131013212121 is a wasteful number, since it uses less digits than its factorization.
131013212121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 744013 (or 744010 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 131013212121 its reverse (121212310131), we get a palindrome (252225522252).
The spelling of 131013212121 in words is "one hundred thirty-one billion, thirteen million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •