Base | Representation |
---|---|
bin | 11000010101000111… |
… | …01100100100001111 |
3 | 1020201022111221212022 |
4 | 30022203230210033 |
5 | 203222340003011 |
6 | 10000044400355 |
7 | 641455302605 |
oct | 141243544417 |
9 | 36638457768 |
10 | 13062031631 |
11 | 55a31a3770 |
12 | 26465460bb |
13 | 13021b05cc |
14 | 8bcab5875 |
15 | 516b068db |
hex | 30a8ec90f |
13062031631 has 16 divisors (see below), whose sum is σ = 15282483840. Its totient is φ = 11037330720.
The previous prime is 13062031621. The next prime is 13062031639. The reversal of 13062031631 is 13613026031.
It is a cyclic number.
It is not a de Polignac number, because 13062031631 - 210 = 13062030607 is a prime.
It is a super-2 number, since 2×130620316312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13062031631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13062031639) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 578525 + ... + 600678.
It is an arithmetic number, because the mean of its divisors is an integer number (955155240).
Almost surely, 213062031631 is an apocalyptic number.
13062031631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13062031631 is a deficient number, since it is larger than the sum of its proper divisors (2220452209).
13062031631 is a wasteful number, since it uses less digits than its factorization.
13062031631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1179286.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 13062031631 its reverse (13613026031), we get a palindrome (26675057662).
The spelling of 13062031631 in words is "thirteen billion, sixty-two million, thirty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •