Base | Representation |
---|---|
bin | 1011000000011111111110… |
… | …0010001000011011000111 |
3 | 1120212001111111220212100221 |
4 | 2300013333202020123013 |
5 | 3041244333230312221 |
6 | 41424045442445211 |
7 | 2356266553432450 |
oct | 260077742103307 |
9 | 46761444825327 |
10 | 12103210010311 |
11 | 3946a40580192 |
12 | 1435824663807 |
13 | 69a4352642c4 |
14 | 2dbb270b2127 |
15 | 15ec73d84541 |
hex | b01ff8886c7 |
12103210010311 has 8 divisors (see below), whose sum is σ = 13864185142304. Its totient is φ = 10350221160960.
The previous prime is 12103210010293. The next prime is 12103210010327. The reversal of 12103210010311 is 11301001230121.
It is a happy number.
12103210010311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12103210010311 - 213 = 12103210002119 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12103210010371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1996567410 + ... + 1996573471.
It is an arithmetic number, because the mean of its divisors is an integer number (1733023142788).
Almost surely, 212103210010311 is an apocalyptic number.
12103210010311 is a deficient number, since it is larger than the sum of its proper divisors (1760975131993).
12103210010311 is an equidigital number, since it uses as much as digits as its factorization.
12103210010311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3993141321.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 12103210010311 its reverse (11301001230121), we get a palindrome (23404211240432).
The spelling of 12103210010311 in words is "twelve trillion, one hundred three billion, two hundred ten million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •