Base | Representation |
---|---|
bin | 1001001000011101111001… |
… | …1111100111010010101011 |
3 | 1022112220202112022112222022 |
4 | 2102013132133213102223 |
5 | 2304003103234300412 |
6 | 33204445435415055 |
7 | 2054305052443466 |
oct | 222073637472253 |
9 | 38486675275868 |
10 | 10041071400107 |
11 | 32214380428a0 |
12 | 116203a5b448b |
13 | 57ab3b186b37 |
14 | 269dc1b122dd |
15 | 1262d0a11a72 |
hex | 921de7e74ab |
10041071400107 has 64 divisors (see below), whose sum is σ = 11756609948160. Its totient is φ = 8487995443200.
The previous prime is 10041071400103. The next prime is 10041071400149. The reversal of 10041071400107 is 70100417014001.
It is a cyclic number.
It is not a de Polignac number, because 10041071400107 - 22 = 10041071400103 is a prime.
It is a super-3 number, since 3×100410714001073 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10041071400103) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1081657688 + ... + 1081666970.
It is an arithmetic number, because the mean of its divisors is an integer number (183697030440).
Almost surely, 210041071400107 is an apocalyptic number.
10041071400107 is a deficient number, since it is larger than the sum of its proper divisors (1715538548053).
10041071400107 is a wasteful number, since it uses less digits than its factorization.
10041071400107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10284.
The product of its (nonzero) digits is 784, while the sum is 26.
Adding to 10041071400107 its reverse (70100417014001), we get a palindrome (80141488414108).
It can be divided in two parts, 100410 and 71400107, that added together give a palindrome (71500517).
The spelling of 10041071400107 in words is "ten trillion, forty-one billion, seventy-one million, four hundred thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •