Base | Representation |
---|---|
bin | 1001000110010000011101… |
… | …1001101111010001100011 |
3 | 1022102021202110010000012220 |
4 | 2101210013121233101203 |
5 | 2302342323333121011 |
6 | 33135210113322123 |
7 | 2051462134521234 |
oct | 221440731572143 |
9 | 38367673100186 |
10 | 10003103020131 |
11 | 3207323968a71 |
12 | 1156802b66343 |
13 | 577399ca0100 |
14 | 26821d2b108b |
15 | 12530c586506 |
hex | 9190766f463 |
10003103020131 has 24 divisors (see below), whose sum is σ = 14546251823040. Its totient is φ = 6111469649376.
The previous prime is 10003103020117. The next prime is 10003103020139. The reversal of 10003103020131 is 13102030130001.
It is not a de Polignac number, because 10003103020131 - 221 = 10003100922979 is a prime.
It is a super-2 number, since 2×100031030201312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10003103020131.
It is not an unprimeable number, because it can be changed into a prime (10003103020139) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 70900701 + ... + 71041646.
It is an arithmetic number, because the mean of its divisors is an integer number (606093825960).
Almost surely, 210003103020131 is an apocalyptic number.
10003103020131 is a deficient number, since it is larger than the sum of its proper divisors (4543148802909).
10003103020131 is a wasteful number, since it uses less digits than its factorization.
10003103020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141942515 (or 141942502 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 10003103020131 its reverse (13102030130001), we get a palindrome (23105133150132).
The spelling of 10003103020131 in words is "ten trillion, three billion, one hundred three million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •