Base | Representation |
---|---|
bin | 1001011010001010001000… |
… | …0111110101010011100111 |
3 | 1100121222020220212122222010 |
4 | 2112202202013311103213 |
5 | 2323443030302223421 |
6 | 34000232234205303 |
7 | 2115254526301110 |
oct | 226424207652347 |
9 | 40558226778863 |
10 | 10345001211111 |
11 | 3329321543286 |
12 | 11b0b1bb83833 |
13 | 5a06b62005a8 |
14 | 27a9b4b37207 |
15 | 12e16d1ce076 |
hex | 968a21f54e7 |
10345001211111 has 16 divisors (see below), whose sum is σ = 15763872740864. Its totient is φ = 5911406249184.
The previous prime is 10345001211089. The next prime is 10345001211131. The reversal of 10345001211111 is 11111210054301.
10345001211111 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 10345001211111 - 218 = 10345000948967 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10345001211131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5610030 + ... + 7222356.
It is an arithmetic number, because the mean of its divisors is an integer number (985242046304).
Almost surely, 210345001211111 is an apocalyptic number.
10345001211111 is a deficient number, since it is larger than the sum of its proper divisors (5418871529753).
10345001211111 is a wasteful number, since it uses less digits than its factorization.
10345001211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1917870.
The product of its (nonzero) digits is 120, while the sum is 21.
Adding to 10345001211111 its reverse (11111210054301), we get a palindrome (21456211265412).
The spelling of 10345001211111 in words is "ten trillion, three hundred forty-five billion, one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •