Base | Representation |
---|---|
bin | 1001000111110101000111… |
… | …0101001101110111110111 |
3 | 1022111212111102020002021010 |
4 | 2101331101311031313313 |
5 | 2303313142103303421 |
6 | 33155435122123303 |
7 | 2053436522253360 |
oct | 221752165156767 |
9 | 38455442202233 |
10 | 10030121541111 |
11 | 3217829141751 |
12 | 115baa34b0533 |
13 | 579ab4766b29 |
14 | 269663774b67 |
15 | 125d8e579076 |
hex | 91f51d4ddf7 |
10030121541111 has 32 divisors (see below), whose sum is σ = 15312665963520. Its totient is φ = 5720751058176.
The previous prime is 10030121541107. The next prime is 10030121541191. The reversal of 10030121541111 is 11114512103001.
It is not a de Polignac number, because 10030121541111 - 22 = 10030121541107 is a prime.
It is a super-3 number, since 3×100301215411113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10030121541101) 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, 51822105 + ... + 52015293.
It is an arithmetic number, because the mean of its divisors is an integer number (478520811360).
Almost surely, 210030121541111 is an apocalyptic number.
10030121541111 is a deficient number, since it is larger than the sum of its proper divisors (5282544422409).
10030121541111 is a wasteful number, since it uses less digits than its factorization.
10030121541111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197823.
The product of its (nonzero) digits is 120, while the sum is 21.
Adding to 10030121541111 its reverse (11114512103001), we get a palindrome (21144633644112).
The spelling of 10030121541111 in words is "ten trillion, thirty billion, one hundred twenty-one million, five hundred forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •