Base | Representation |
---|---|
bin | 11101110010100110000000… |
… | …111011010111110011000100 |
3 | 122011220101212212011122200202 |
4 | 131302212000323113303010 |
5 | 114133113221421141400 |
6 | 1142353453243230032 |
7 | 36411615135142232 |
oct | 3562460073276304 |
9 | 564811785148622 |
10 | 131020140412100 |
11 | 388243696358a5 |
12 | 128406b7b18318 |
13 | 58151b934b424 |
14 | 244d5a13db952 |
15 | 10232040644d5 |
hex | 772980ed7cc4 |
131020140412100 has 18 divisors (see below), whose sum is σ = 284313704694474. Its totient is φ = 52408056164800.
The previous prime is 131020140412061. The next prime is 131020140412129. The reversal of 131020140412100 is 1214041020131.
It can be written as a sum of positive squares in 3 ways, for example, as 563721662596 + 130456418749504 = 750814^2 + 11421752^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 655100701961 + ... + 655100702160.
Almost surely, 2131020140412100 is an apocalyptic number.
131020140412100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131020140412100 is an abundant number, since it is smaller than the sum of its proper divisors (153293564282374).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131020140412100 is a wasteful number, since it uses less digits than its factorization.
131020140412100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1310201404135 (or 1310201404128 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 131020140412100 its reverse (1214041020131), we get a palindrome (132234181432231).
The spelling of 131020140412100 in words is "one hundred thirty-one trillion, twenty billion, one hundred forty million, four hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •