Base | Representation |
---|---|
bin | 1011000000100000011000… |
… | …1001100001100001001011 |
3 | 1120212001210020202201121120 |
4 | 2300020012021201201023 |
5 | 3041300100134000021 |
6 | 41424104445410323 |
7 | 2356302402015543 |
oct | 260100611414113 |
9 | 46761706681546 |
10 | 12103321000011 |
11 | 3946a9819840a |
12 | 14358558699a3 |
13 | 69a452254c97 |
14 | 2dbb37b24323 |
15 | 15ec7d9aa2c6 |
hex | b020626184b |
12103321000011 has 4 divisors (see below), whose sum is σ = 16137761333352. Its totient is φ = 8068880666672.
The previous prime is 12103321000009. The next prime is 12103321000013. The reversal of 12103321000011 is 11000012330121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (12103321000009) and next prime (12103321000013).
It is a cyclic number.
It is not a de Polignac number, because 12103321000011 - 21 = 12103321000009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12103321000013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2017220166666 + ... + 2017220166671.
It is an arithmetic number, because the mean of its divisors is an integer number (4034440333338).
Almost surely, 212103321000011 is an apocalyptic number.
12103321000011 is a deficient number, since it is larger than the sum of its proper divisors (4034440333341).
12103321000011 is an equidigital number, since it uses as much as digits as its factorization.
12103321000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4034440333340.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 12103321000011 its reverse (11000012330121), we get a palindrome (23103333330132).
The spelling of 12103321000011 in words is "twelve trillion, one hundred three billion, three hundred twenty-one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •