Base | Representation |
---|---|
bin | 10111100000101101101011… |
… | …011100010101111010110000 |
3 | 111120010020120122002001110101 |
4 | 113200231223130111322300 |
5 | 102023124112400234440 |
6 | 1003530425152442144 |
7 | 30531426132005164 |
oct | 2740555334257260 |
9 | 446106518061411 |
10 | 103403140243120 |
11 | 2aa47030a533a3 |
12 | b72027a549354 |
13 | 4590b49a5c5b3 |
14 | 1b76a4ad7cca4 |
15 | be4b4645469a |
hex | 5e0b6b715eb0 |
103403140243120 has 40 divisors (see below), whose sum is σ = 254554201131264. Its totient is φ = 38928241032192.
The previous prime is 103403140243111. The next prime is 103403140243121. The reversal of 103403140243120 is 21342041304301.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is not an unprimeable number, because it can be changed into a prime (103403140243121) 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, 38015859024 + ... + 38015861743.
Almost surely, 2103403140243120 is an apocalyptic number.
103403140243120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103403140243120 is an abundant number, since it is smaller than the sum of its proper divisors (151151060888144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103403140243120 is a wasteful number, since it uses less digits than its factorization.
103403140243120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76031720797 (or 76031720791 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 103403140243120 its reverse (21342041304301), we get a palindrome (124745181547421).
The spelling of 103403140243120 in words is "one hundred three trillion, four hundred three billion, one hundred forty million, two hundred forty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •