Base | Representation |
---|---|
bin | 1001000111111001001111… |
… | …1010000111010101100001 |
3 | 1022111222100200012210102010 |
4 | 2101332103322013111201 |
5 | 2303322424402340223 |
6 | 33200141122543133 |
7 | 2053506143113542 |
oct | 221762372072541 |
9 | 38458320183363 |
10 | 10031230121313 |
11 | 3218247987435 |
12 | 1160152807aa9 |
13 | 579c3033004b |
14 | 26972aaa84c9 |
15 | 125e06a57393 |
hex | 91f93e87561 |
10031230121313 has 16 divisors (see below), whose sum is σ = 13402400221440. Its totient is φ = 6673779893904.
The previous prime is 10031230121287. The next prime is 10031230121329. The reversal of 10031230121313 is 31312103213001.
It is a happy number.
It is not a de Polignac number, because 10031230121313 - 29 = 10031230120801 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10031230121313.
It is not an unprimeable number, because it can be changed into a prime (10031230161313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5368470 + ... + 6991632.
It is an arithmetic number, because the mean of its divisors is an integer number (837650013840).
Almost surely, 210031230121313 is an apocalyptic number.
It is an amenable number.
10031230121313 is a deficient number, since it is larger than the sum of its proper divisors (3371170100127).
10031230121313 is a wasteful number, since it uses less digits than its factorization.
10031230121313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1627388.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10031230121313 its reverse (31312103213001), we get a palindrome (41343333334314).
The spelling of 10031230121313 in words is "ten trillion, thirty-one billion, two hundred thirty million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •