Base | Representation |
---|---|
bin | 1001000111111001001111… |
… | …1010011111101100111001 |
3 | 1022111222100200101212022102 |
4 | 2101332103322133230321 |
5 | 2303322424414033423 |
6 | 33200141125033145 |
7 | 2053506144010523 |
oct | 221762372375471 |
9 | 38458320355272 |
10 | 10031230221113 |
11 | 3218247a45412 |
12 | 11601528557b5 |
13 | 579c303665ba |
14 | 26972aad2a13 |
15 | 125e06a76c28 |
hex | 91f93e9fb39 |
10031230221113 has 12 divisors (see below), whose sum is σ = 10131637586148. Its totient is φ = 9931808437920.
The previous prime is 10031230221017. The next prime is 10031230221193. The reversal of 10031230221113 is 31112203213001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 5143628953849 + 4887601267264 = 2267957^2 + 2210792^2 .
It is not a de Polignac number, because 10031230221113 - 214 = 10031230204729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10031230221193) 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, 53173631 + ... + 53361947.
It is an arithmetic number, because the mean of its divisors is an integer number (844303132179).
Almost surely, 210031230221113 is an apocalyptic number.
It is an amenable number.
10031230221113 is a deficient number, since it is larger than the sum of its proper divisors (100407365035).
10031230221113 is an equidigital number, since it uses as much as digits as its factorization.
10031230221113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193544 (or 193441 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10031230221113 its reverse (31112203213001), we get a palindrome (41143433434114).
The spelling of 10031230221113 in words is "ten trillion, thirty-one billion, two hundred thirty million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •