Base | Representation |
---|---|
bin | 10111011100100111001100… |
… | …101001011101101101010001 |
3 | 111112010022002221000102111200 |
4 | 113130213030221131231101 |
5 | 102004014412111400223 |
6 | 1003153134523301413 |
7 | 30502161011641053 |
oct | 2734471451355521 |
9 | 445108087012450 |
10 | 103121303231313 |
11 | 2a948554341a44 |
12 | b69572397a869 |
13 | 45703b2b59ba3 |
14 | 1b671521738d3 |
15 | bdc64d5e6a43 |
hex | 5dc9cca5db51 |
103121303231313 has 12 divisors (see below), whose sum is σ = 153757928832768. Its totient is φ = 66529873052280.
The previous prime is 103121303231273. The next prime is 103121303231351. The reversal of 103121303231313 is 313132303121301.
103121303231313 is a `hidden beast` number, since 1 + 0 + 3 + 1 + 21 + 3 + 0 + 323 + 1 + 313 = 666.
It is not a de Polignac number, because 103121303231313 - 28 = 103121303231057 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103121303239313) 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, 184805202645 + ... + 184805203202.
It is an arithmetic number, because the mean of its divisors is an integer number (12813160736064).
Almost surely, 2103121303231313 is an apocalyptic number.
It is an amenable number.
103121303231313 is a deficient number, since it is larger than the sum of its proper divisors (50636625601455).
103121303231313 is a wasteful number, since it uses less digits than its factorization.
103121303231313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 369610405884 (or 369610405881 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
Adding to 103121303231313 its reverse (313132303121301), we get a palindrome (416253606352614).
The spelling of 103121303231313 in words is "one hundred three trillion, one hundred twenty-one billion, three hundred three million, two hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •