Base | Representation |
---|---|
bin | 1001010111100010100000… |
… | …0001101111111110111011 |
3 | 1100110200002221000221201000 |
4 | 2111320220001233332323 |
5 | 2322223401244420011 |
6 | 33523431153100043 |
7 | 2112102451665201 |
oct | 225705001577673 |
9 | 40420087027630 |
10 | 10300003123131 |
11 | 3311230273817 |
12 | 11a4262257623 |
13 | 59939480b827 |
14 | 278746845071 |
15 | 12cdd7a1c356 |
hex | 95e2806ffbb |
10300003123131 has 64 divisors (see below), whose sum is σ = 15394495564800. Its totient is φ = 6806104330752.
The previous prime is 10300003123061. The next prime is 10300003123147. The reversal of 10300003123131 is 13132130000301.
It is a happy number.
10300003123131 is a `hidden beast` number, since 10 + 30 + 0 + 0 + 0 + 312 + 313 + 1 = 666.
It is not a de Polignac number, because 10300003123131 - 210 = 10300003122107 is a prime.
It is a super-2 number, since 2×103000031231312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10300003123171) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2100752826 + ... + 2100757728.
It is an arithmetic number, because the mean of its divisors is an integer number (240538993200).
Almost surely, 210300003123131 is an apocalyptic number.
10300003123131 is a deficient number, since it is larger than the sum of its proper divisors (5094492441669).
10300003123131 is a wasteful number, since it uses less digits than its factorization.
10300003123131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6417 (or 6411 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 10300003123131 its reverse (13132130000301), we get a palindrome (23432133123432).
The spelling of 10300003123131 in words is "ten trillion, three hundred billion, three million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •