Base | Representation |
---|---|
bin | 10111011111010110111101… |
… | …000011010001101001000011 |
3 | 111112210100012221010211110010 |
4 | 113133112331003101221003 |
5 | 102020112410122420303 |
6 | 1003415545033240003 |
7 | 30521621415025125 |
oct | 2737267503215103 |
9 | 445710187124403 |
10 | 103310020123203 |
11 | 2aa10596089003 |
12 | b706210863003 |
13 | 45851296b941a |
14 | 1b7233592b215 |
15 | be24e6207c03 |
hex | 5df5bd0d1a43 |
103310020123203 has 8 divisors (see below), whose sum is σ = 142496579480400. Its totient is φ = 66498403757408.
The previous prime is 103310020123181. The next prime is 103310020123243. The reversal of 103310020123203 is 302321020013301.
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 103310020123203 - 26 = 103310020123139 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103310020123203.
It is not an unprimeable number, because it can be changed into a prime (103310020123243) 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, 593735747748 + ... + 593735747921.
It is an arithmetic number, because the mean of its divisors is an integer number (17812072435050).
Almost surely, 2103310020123203 is an apocalyptic number.
103310020123203 is a deficient number, since it is larger than the sum of its proper divisors (39186559357197).
103310020123203 is a wasteful number, since it uses less digits than its factorization.
103310020123203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1187471495701.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 103310020123203 its reverse (302321020013301), we get a palindrome (405631040136504).
The spelling of 103310020123203 in words is "one hundred three trillion, three hundred ten billion, twenty million, one hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •