Base | Representation |
---|---|
bin | 110000001010001011… |
… | …0000110100010111001 |
3 | 100212221120000110101201 |
4 | 1200110112012202321 |
5 | 3143301130202101 |
6 | 115302153214201 |
7 | 10320600125254 |
oct | 1402426064271 |
9 | 325846013351 |
10 | 103420553401 |
11 | 3a95122a540 |
12 | 18063401361 |
13 | 99a2380839 |
14 | 501145c09b |
15 | 2a546a1e01 |
hex | 18145868b9 |
103420553401 has 8 divisors (see below), whose sum is σ = 112840684704. Its totient is φ = 94003465920.
The previous prime is 103420553381. The next prime is 103420553419. The reversal of 103420553401 is 104355024301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103420553401 - 221 = 103418456249 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103420553401.
It is not an unprimeable number, because it can be changed into a prime (103420553471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 689616 + ... + 826081.
It is an arithmetic number, because the mean of its divisors is an integer number (14105085588).
Almost surely, 2103420553401 is an apocalyptic number.
103420553401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103420553401 is a deficient number, since it is larger than the sum of its proper divisors (9420131303).
103420553401 is a wasteful number, since it uses less digits than its factorization.
103420553401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1521911.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 103420553401 its reverse (104355024301), we get a palindrome (207775577702).
The spelling of 103420553401 in words is "one hundred three billion, four hundred twenty million, five hundred fifty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.010 sec. • engine limits •