Base | Representation |
---|---|
bin | 1001001110010010100111… |
… | …1100011111101100111010 |
3 | 1022220111000012020202100110 |
4 | 2103210221330133230322 |
5 | 2312123004101311302 |
6 | 33322433352445150 |
7 | 2064446305365534 |
oct | 223445174375472 |
9 | 38814005222313 |
10 | 10141121510202 |
11 | 325a9097943a1 |
12 | 11795010a97b6 |
13 | 5873c418cb07 |
14 | 270b93698854 |
15 | 128bd9348b6c |
hex | 93929f1fb3a |
10141121510202 has 64 divisors (see below), whose sum is σ = 21131619840000. Its totient is φ = 3240939219840.
The previous prime is 10141121510197. The next prime is 10141121510207. The reversal of 10141121510202 is 20201512114101.
It is an interprime number because it is at equal distance from previous prime (10141121510197) and next prime (10141121510207).
It is not an unprimeable number, because it can be changed into a prime (10141121510207) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12316749 + ... + 13114287.
It is an arithmetic number, because the mean of its divisors is an integer number (330181560000).
Almost surely, 210141121510202 is an apocalyptic number.
10141121510202 is an abundant number, since it is smaller than the sum of its proper divisors (10990498329798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10141121510202 is a wasteful number, since it uses less digits than its factorization.
10141121510202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 798211.
The product of its (nonzero) digits is 160, while the sum is 21.
Adding to 10141121510202 its reverse (20201512114101), we get a palindrome (30342633624303).
The spelling of 10141121510202 in words is "ten trillion, one hundred forty-one billion, one hundred twenty-one million, five hundred ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •