Base | Representation |
---|---|
bin | 10111100000101110101011… |
… | …011110011000100100111011 |
3 | 111120010100100111111222110112 |
4 | 113200232223132120210323 |
5 | 102023133312404120443 |
6 | 1003531123530134535 |
7 | 30531464555135126 |
oct | 2740565336304473 |
9 | 446110314458415 |
10 | 103404214520123 |
11 | 2aa47532399630 |
12 | b72051a28144b |
13 | 4590c8b4a4c6a |
14 | 1b76b0d9033bd |
15 | be4baa908b18 |
hex | 5e0bab79893b |
103404214520123 has 12 divisors (see below), whose sum is σ = 114180063876888. Its totient is φ = 92871255032160.
The previous prime is 103404214520081. The next prime is 103404214520279. The reversal of 103404214520123 is 321025412404301.
It is not a de Polignac number, because 103404214520123 - 228 = 103403946084667 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103404214520123.
It is not an unprimeable number, because it can be changed into a prime (103404214528123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 682199090 + ... + 682350647.
It is an arithmetic number, because the mean of its divisors is an integer number (9515005323074).
Almost surely, 2103404214520123 is an apocalyptic number.
103404214520123 is a deficient number, since it is larger than the sum of its proper divisors (10775849356765).
103404214520123 is an equidigital number, since it uses as much as digits as its factorization.
103404214520123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1364549914 (or 1364549831 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 103404214520123 its reverse (321025412404301), we get a palindrome (424429626924424).
The spelling of 103404214520123 in words is "one hundred three trillion, four hundred four billion, two hundred fourteen million, five hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •