Base | Representation |
---|---|
bin | 10111011100010110001001… |
… | …110101011101001100110110 |
3 | 111112001112212111211111211012 |
4 | 113130112021311131030312 |
5 | 102003214422110313220 |
6 | 1003140510533512222 |
7 | 30500642341500656 |
oct | 2734261165351466 |
9 | 445045774744735 |
10 | 103103002432310 |
11 | 2a940812a8a871 |
12 | b692076aa2672 |
13 | 456b75750bc3a |
14 | 1b662d7806366 |
15 | bdbe2bb22ac5 |
hex | 5dc589d5d336 |
103103002432310 has 8 divisors (see below), whose sum is σ = 185585404378176. Its totient is φ = 41241200972920.
The previous prime is 103103002432303. The next prime is 103103002432319. The reversal of 103103002432310 is 13234200301301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1031030024323102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103103002432319) 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, 5155150121606 + ... + 5155150121625.
It is an arithmetic number, because the mean of its divisors is an integer number (23198175547272).
Almost surely, 2103103002432310 is an apocalyptic number.
103103002432310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103103002432310 is a deficient number, since it is larger than the sum of its proper divisors (82482401945866).
103103002432310 is a wasteful number, since it uses less digits than its factorization.
103103002432310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10310300243238.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 103103002432310 its reverse (13234200301301), we get a palindrome (116337202733611).
The spelling of 103103002432310 in words is "one hundred three trillion, one hundred three billion, two million, four hundred thirty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •