Base | Representation |
---|---|
bin | 111100100010010011… |
… | …1011010000101010101 |
3 | 110102112221022102000000 |
4 | 1321010213122011111 |
5 | 4112220022400041 |
6 | 135415443241513 |
7 | 12251345316336 |
oct | 1710447320525 |
9 | 412487272000 |
10 | 130000200021 |
11 | 501507a643a |
12 | 21240979299 |
13 | c349c448a3 |
14 | 641351c28d |
15 | 35acda2bb6 |
hex | 1e449da155 |
130000200021 has 14 divisors (see below), whose sum is σ = 194911137750. Its totient is φ = 86666799528.
The previous prime is 130000199981. The next prime is 130000200023. The reversal of 130000200021 is 120002000031.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 105729675921 + 24270524100 = 325161^2 + 155790^2 .
It is not a de Polignac number, because 130000200021 - 213 = 130000191829 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 130000199976 and 130000200012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130000200023) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 89162646 + ... + 89164103.
It is an arithmetic number, because the mean of its divisors is an integer number (13922224125).
Almost surely, 2130000200021 is an apocalyptic number.
It is an amenable number.
130000200021 is a deficient number, since it is larger than the sum of its proper divisors (64910937729).
130000200021 is an frugal number, since it uses more digits than its factorization.
130000200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178326767 (or 178326752 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 130000200021 its reverse (120002000031), we get a palindrome (250002200052).
The spelling of 130000200021 in words is "one hundred thirty billion, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •