Base | Representation |
---|---|
bin | 1001001100101010100111… |
… | …0000010100101110100111 |
3 | 1022210210221100221111202000 |
4 | 2103022221300110232213 |
5 | 2311143313431011403 |
6 | 33301535044020343 |
7 | 2062440356264001 |
oct | 223125160245647 |
9 | 38723840844660 |
10 | 10113201032103 |
11 | 3249a91371a04 |
12 | 117400a6916b3 |
13 | 584894895960 |
14 | 26d6a54c9371 |
15 | 12810308e7a3 |
hex | 932a9c14ba7 |
10113201032103 has 64 divisors (see below), whose sum is σ = 17085268569600. Its totient is φ = 5857032844800.
The previous prime is 10113201032101. The next prime is 10113201032153. The reversal of 10113201032103 is 30123010231101.
10113201032103 is a `hidden beast` number, since 1 + 0 + 11 + 320 + 10 + 321 + 0 + 3 = 666.
It is not a de Polignac number, because 10113201032103 - 21 = 10113201032101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113201032101) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 107711128 + ... + 107804978.
It is an arithmetic number, because the mean of its divisors is an integer number (266957321400).
Almost surely, 210113201032103 is an apocalyptic number.
10113201032103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10113201032103 is a deficient number, since it is larger than the sum of its proper divisors (6972067537497).
10113201032103 is a wasteful number, since it uses less digits than its factorization.
10113201032103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111949 (or 111943 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10113201032103 its reverse (30123010231101), we get a palindrome (40236211263204).
The spelling of 10113201032103 in words is "ten trillion, one hundred thirteen billion, two hundred one million, thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •