Base | Representation |
---|---|
bin | 1001001110010010100101… |
… | …0001010111000000100111 |
3 | 1022220110222101222020222020 |
4 | 2103210221101113000213 |
5 | 2312122443202434112 |
6 | 33322432310234223 |
7 | 2064446110311312 |
oct | 223445121270047 |
9 | 38813871866866 |
10 | 10141110202407 |
11 | 325a903370708 |
12 | 11794b9355973 |
13 | 5873c1a30c02 |
14 | 270b91d93979 |
15 | 128bd836348c |
hex | 93929457027 |
10141110202407 has 16 divisors (see below), whose sum is σ = 13972922755968. Its totient is φ = 6538132288800.
The previous prime is 10141110202387. The next prime is 10141110202423. The reversal of 10141110202407 is 70420201114101.
It is a happy number.
It is not a de Polignac number, because 10141110202407 - 212 = 10141110198311 is a prime.
It is a super-2 number, since 2×101411102024072 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10141110200407) 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, 389161513 + ... + 389187570.
It is an arithmetic number, because the mean of its divisors is an integer number (873307672248).
Almost surely, 210141110202407 is an apocalyptic number.
10141110202407 is a deficient number, since it is larger than the sum of its proper divisors (3831812553561).
10141110202407 is a wasteful number, since it uses less digits than its factorization.
10141110202407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778349230.
The product of its (nonzero) digits is 448, while the sum is 24.
Adding to 10141110202407 its reverse (70420201114101), we get a palindrome (80561311316508).
The spelling of 10141110202407 in words is "ten trillion, one hundred forty-one billion, one hundred ten million, two hundred two thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •