Base | Representation |
---|---|
bin | 1011000111111000110000… |
… | …0001100011101001010111 |
3 | 1121022012002011112201111100 |
4 | 2301332030001203221113 |
5 | 3100334242001010403 |
6 | 42002235020041143 |
7 | 2401411542122031 |
oct | 261761401435127 |
9 | 47265064481440 |
10 | 12230121110103 |
11 | 3995846589926 |
12 | 14563429931b3 |
13 | 6a93ac1c9120 |
14 | 303d26232c51 |
15 | 1632009432a3 |
hex | b1f8c063a57 |
12230121110103 has 12 divisors (see below), whose sum is σ = 19024632838120. Its totient is φ = 7526228375376.
The previous prime is 12230121110101. The next prime is 12230121110107. The reversal of 12230121110103 is 30101112103221.
12230121110103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12230121110103 - 21 = 12230121110101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12230121110101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52265474713 + ... + 52265474946.
Almost surely, 212230121110103 is an apocalyptic number.
12230121110103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12230121110103 is a deficient number, since it is larger than the sum of its proper divisors (6794511728017).
12230121110103 is a wasteful number, since it uses less digits than its factorization.
12230121110103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104530949678 (or 104530949675 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 12230121110103 its reverse (30101112103221), we get a palindrome (42331233213324).
The spelling of 12230121110103 in words is "twelve trillion, two hundred thirty billion, one hundred twenty-one million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •