Base | Representation |
---|---|
bin | 111101000000011001… |
… | …1100100001010100000 |
3 | 110112011022110120120222 |
4 | 1322000303210022200 |
5 | 4121302031120000 |
6 | 140103555222212 |
7 | 12315356540036 |
oct | 1720063441240 |
9 | 415138416528 |
10 | 131010020000 |
11 | 50619817102 |
12 | 21482ba7968 |
13 | c47b20c6c2 |
14 | 64ab6a4556 |
15 | 361b873a85 |
hex | 1e80ce42a0 |
131010020000 has 60 divisors (see below), whose sum is σ = 322304349906. Its totient is φ = 52404000000.
The previous prime is 131010019969. The next prime is 131010020003. The reversal of 131010020000 is 20010131.
It can be written as a sum of positive squares in 5 ways, for example, as 1032465424 + 129977554576 = 32132^2 + 360524^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 131010020000.
It is not an unprimeable number, because it can be changed into a prime (131010020003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3255251 + ... + 3295250.
Almost surely, 2131010020000 is an apocalyptic number.
131010020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131010020000 is an abundant number, since it is smaller than the sum of its proper divisors (191294329906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131010020000 is an frugal number, since it uses more digits than its factorization.
131010020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6550531 (or 6550508 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 8.
Adding to 131010020000 its reverse (20010131), we get a palindrome (131030030131).
The spelling of 131010020000 in words is "one hundred thirty-one billion, ten million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •