Base | Representation |
---|---|
bin | 11000011010000000… |
… | …00001000110110111 |
3 | 1020211011121212221020 |
4 | 30031000001012313 |
5 | 203313332311411 |
6 | 10004110552223 |
7 | 642463515003 |
oct | 141500010667 |
9 | 36734555836 |
10 | 13103010231 |
11 | 5614342583 |
12 | 2658208673 |
13 | 130a82a6bc |
14 | 8c4301703 |
15 | 51a4ed606 |
hex | 30d0011b7 |
13103010231 has 32 divisors (see below), whose sum is σ = 19097856000. Its totient is φ = 7965205248.
The previous prime is 13103010211. The next prime is 13103010233. The reversal of 13103010231 is 13201030131.
It is not a de Polignac number, because 13103010231 - 29 = 13103009719 is a prime.
It is a super-2 number, since 2×131030102312 (a number of 21 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 13103010231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13103010233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 116635 + ... + 199523.
It is an arithmetic number, because the mean of its divisors is an integer number (596808000).
Almost surely, 213103010231 is an apocalyptic number.
13103010231 is a deficient number, since it is larger than the sum of its proper divisors (5994845769).
13103010231 is a wasteful number, since it uses less digits than its factorization.
13103010231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83023.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13103010231 its reverse (13201030131), we get a palindrome (26304040362).
The spelling of 13103010231 in words is "thirteen billion, one hundred three million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •