Base | Representation |
---|---|
bin | 1001001110001110100100… |
… | …1000011010001000110111 |
3 | 1022220101012102010022022212 |
4 | 2103203221020122020313 |
5 | 2312113242213122403 |
6 | 33322133430044035 |
7 | 2064410332565525 |
oct | 223435110321067 |
9 | 38811172108285 |
10 | 10140034114103 |
11 | 325a4009a8633 |
12 | 1179258aa961b |
13 | 58727cb02c7a |
14 | 270acd0bb315 |
15 | 128b73b524d8 |
hex | 938e921a237 |
10140034114103 has 4 divisors (see below), whose sum is σ = 10190989059600. Its totient is φ = 10089079168608.
The previous prime is 10140034114079. The next prime is 10140034114129. The reversal of 10140034114103 is 30141143004101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10140034114103 - 214 = 10140034097719 is a prime.
It is a super-2 number, since 2×101400341141032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140034114003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25477472450 + ... + 25477472847.
It is an arithmetic number, because the mean of its divisors is an integer number (2547747264900).
Almost surely, 210140034114103 is an apocalyptic number.
10140034114103 is a deficient number, since it is larger than the sum of its proper divisors (50954945497).
10140034114103 is an equidigital number, since it uses as much as digits as its factorization.
10140034114103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50954945496.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 10140034114103 its reverse (30141143004101), we get a palindrome (40281177118204).
The spelling of 10140034114103 in words is "ten trillion, one hundred forty billion, thirty-four million, one hundred fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •