Base | Representation |
---|---|
bin | 1001011110000100100000… |
… | …0110001010100010101111 |
3 | 1100212101201211122012001101 |
4 | 2113201020012022202233 |
5 | 2331043201314113403 |
6 | 34051145310223531 |
7 | 2123154164161642 |
oct | 227411006124257 |
9 | 40771654565041 |
10 | 10412210301103 |
11 | 33548802a6356 |
12 | 1201b581b4ba7 |
13 | 5a6b373812b0 |
14 | 27dd4cc13a59 |
15 | 130ca379d71d |
hex | 9784818a8af |
10412210301103 has 16 divisors (see below), whose sum is σ = 11579833204576. Its totient is φ = 9299841102720.
The previous prime is 10412210301071. The next prime is 10412210301107. The reversal of 10412210301103 is 30110301221401.
It is a cyclic number.
It is not a de Polignac number, because 10412210301103 - 25 = 10412210301071 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10412210301107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59711301 + ... + 59885422.
It is an arithmetic number, because the mean of its divisors is an integer number (723739575286).
Almost surely, 210412210301103 is an apocalyptic number.
10412210301103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10412210301103 is a deficient number, since it is larger than the sum of its proper divisors (1167622903473).
10412210301103 is a wasteful number, since it uses less digits than its factorization.
10412210301103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119596954.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10412210301103 its reverse (30110301221401), we get a palindrome (40522511522504).
The spelling of 10412210301103 in words is "ten trillion, four hundred twelve billion, two hundred ten million, three hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •