Base | Representation |
---|---|
bin | 1001001110010000000011… |
… | …0110100111011011110011 |
3 | 1022220102020011000020200010 |
4 | 2103210000312213123303 |
5 | 2312120101104300110 |
6 | 33322241124230003 |
7 | 2064423234463464 |
oct | 223440066473363 |
9 | 38812204006603 |
10 | 10140432103155 |
11 | 325a59561a702 |
12 | 117934a23b303 |
13 | 5873143bc153 |
14 | 270b29cbad6b |
15 | 128b98a6a020 |
hex | 93900da76f3 |
10140432103155 has 32 divisors (see below), whose sum is σ = 17022627053568. Its totient is φ = 5147971862400.
The previous prime is 10140432103147. The next prime is 10140432103159. The reversal of 10140432103155 is 55130123404101.
10140432103155 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 10140432103155 - 23 = 10140432103147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10140432103159) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 178720659 + ... + 178777388.
It is an arithmetic number, because the mean of its divisors is an integer number (531957095424).
Almost surely, 210140432103155 is an apocalyptic number.
10140432103155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10140432103155 is a deficient number, since it is larger than the sum of its proper divisors (6882194950413).
10140432103155 is a wasteful number, since it uses less digits than its factorization.
10140432103155 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 357498147.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 10140432103155 its reverse (55130123404101), we get a palindrome (65270555507256).
The spelling of 10140432103155 in words is "ten trillion, one hundred forty billion, four hundred thirty-two million, one hundred three thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •