Base | Representation |
---|---|
bin | 1011000110001100011000… |
… | …0111101001001011101111 |
3 | 1121012101222211101200101100 |
4 | 2301203012013221023233 |
5 | 3044400202414404403 |
6 | 41541024250214143 |
7 | 2366331631305432 |
oct | 261430607511357 |
9 | 47171884350340 |
10 | 12201031013103 |
11 | 3984478a21449 |
12 | 1450784724353 |
13 | 6a67244b708a |
14 | 3027669a1819 |
15 | 16259bb502a3 |
hex | b18c61e92ef |
12201031013103 has 12 divisors (see below), whose sum is σ = 17669726380800. Its totient is φ = 8112783021216.
The previous prime is 12201031013047. The next prime is 12201031013123. The reversal of 12201031013103 is 30131013010221.
12201031013103 is a `hidden beast` number, since 1 + 220 + 1 + 0 + 310 + 131 + 0 + 3 = 666.
It is not a de Polignac number, because 12201031013103 - 28 = 12201031012847 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201031013123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1769800878 + ... + 1769807771.
It is an arithmetic number, because the mean of its divisors is an integer number (1472477198400).
Almost surely, 212201031013103 is an apocalyptic number.
12201031013103 is a deficient number, since it is larger than the sum of its proper divisors (5468695367697).
12201031013103 is a wasteful number, since it uses less digits than its factorization.
12201031013103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3539609038 (or 3539609035 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 12201031013103 its reverse (30131013010221), we get a palindrome (42332044023324).
The spelling of 12201031013103 in words is "twelve trillion, two hundred one billion, thirty-one million, thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •