Base | Representation |
---|---|
bin | 11101100011111011010011… |
… | …000011101010010000010000 |
3 | 122001100001012211100102000210 |
4 | 131203323103003222100100 |
5 | 114020104441424031000 |
6 | 1140302440335444120 |
7 | 36246033353415042 |
oct | 3543732303522020 |
9 | 561301184312023 |
10 | 130012201002000 |
11 | 38475957066659 |
12 | 126b929b086640 |
13 | 57711372650b5 |
14 | 24168a477da92 |
15 | 1006db07c0350 |
hex | 763ed30ea410 |
130012201002000 has 80 divisors (see below), whose sum is σ = 419159336049792. Its totient is φ = 34669920265600.
The previous prime is 130012201001981. The next prime is 130012201002001. The reversal of 130012201002000 is 200102210031.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (130012201002001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10834344084 + ... + 10834356083.
Almost surely, 2130012201002000 is an apocalyptic number.
130012201002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130012201002000 is an abundant number, since it is smaller than the sum of its proper divisors (289147135047792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130012201002000 is a wasteful number, since it uses less digits than its factorization.
130012201002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21668700193 (or 21668700177 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 130012201002000 its reverse (200102210031), we get a palindrome (130212303212031).
The spelling of 130012201002000 in words is "one hundred thirty trillion, twelve billion, two hundred one million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •