Base | Representation |
---|---|
bin | 1011000000010111110001… |
… | …1001110011100000111111 |
3 | 1120211211211012020101100021 |
4 | 2300011330121303200333 |
5 | 3041230332030342343 |
6 | 41423043253113011 |
7 | 2356161210652036 |
oct | 260057431634077 |
9 | 46754735211307 |
10 | 12101010012223 |
11 | 3946011752050 |
12 | 143530b928767 |
13 | 69a1745337a2 |
14 | 2db998c3571d |
15 | 15eb95b680ed |
hex | b017c67383f |
12101010012223 has 16 divisors (see below), whose sum is σ = 13207801744800. Its totient is φ = 10995335833600.
The previous prime is 12101010012209. The next prime is 12101010012229. The reversal of 12101010012223 is 32221001010121.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12101010012223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12101010012197 and 12101010012206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101010012229) 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 15 ways as a sum of consecutive naturals, for example, 562277703 + ... + 562299223.
It is an arithmetic number, because the mean of its divisors is an integer number (825487609050).
Almost surely, 212101010012223 is an apocalyptic number.
12101010012223 is a deficient number, since it is larger than the sum of its proper divisors (1106791732577).
12101010012223 is a wasteful number, since it uses less digits than its factorization.
12101010012223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45098.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12101010012223 its reverse (32221001010121), we get a palindrome (44322011022344).
The spelling of 12101010012223 in words is "twelve trillion, one hundred one billion, ten million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •