Base | Representation |
---|---|
bin | 101011101010000100000… |
… | …101001101011111101001 |
3 | 101121210210100022212201222 |
4 | 223222010011031133221 |
5 | 343123202400143423 |
6 | 10214121153551425 |
7 | 426515231566634 |
oct | 53520405153751 |
9 | 11553710285658 |
10 | 3000103131113 |
11 | a57378006700 |
12 | 405534575575 |
13 | 189ba6ccb92a |
14 | a52c48a0c1b |
15 | 5308d8163c8 |
hex | 2ba8414d7e9 |
3000103131113 has 12 divisors (see below), whose sum is σ = 3297733953024. Its totient is φ = 2727283831800.
The previous prime is 3000103131061. The next prime is 3000103131349. The reversal of 3000103131113 is 3111313010003.
3000103131113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3000103131113 - 218 = 3000102868969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3000103131091 and 3000103131100.
It is not an unprimeable number, because it can be changed into a prime (3000103131013) 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, 3827120 + ... + 4543902.
It is an arithmetic number, because the mean of its divisors is an integer number (274811162752).
Almost surely, 23000103131113 is an apocalyptic number.
It is an amenable number.
3000103131113 is a deficient number, since it is larger than the sum of its proper divisors (297630821911).
3000103131113 is a wasteful number, since it uses less digits than its factorization.
3000103131113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751396 (or 751385 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 3000103131113 its reverse (3111313010003), we get a palindrome (6111416141116).
The spelling of 3000103131113 in words is "three trillion, one hundred three million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •