Base | Representation |
---|---|
bin | 100110001100… |
… | …100101100111 |
3 | 200211201022000 |
4 | 212030211213 |
5 | 10030404111 |
6 | 554340343 |
7 | 151052340 |
oct | 46144547 |
9 | 20751260 |
10 | 10013031 |
11 | 5719a36 |
12 | 342a6b3 |
13 | 20c7792 |
14 | 14890c7 |
15 | d2bc56 |
hex | 98c967 |
10013031 has 32 divisors (see below), whose sum is σ = 17510400. Its totient is φ = 5533920.
The previous prime is 10013011. The next prime is 10013053. The reversal of 10013031 is 13031001.
10013031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10013031 - 25 = 10012999 is a prime.
It is a super-2 number, since 2×100130312 = 200521579613922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10013011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5005 + ... + 6713.
It is an arithmetic number, because the mean of its divisors is an integer number (547200).
Almost surely, 210013031 is an apocalyptic number.
10013031 is a deficient number, since it is larger than the sum of its proper divisors (7497369).
10013031 is a wasteful number, since it uses less digits than its factorization.
10013031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1756 (or 1750 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 10013031 is about 3164.3373713939. The cubic root of 10013031 is about 215.5370098454.
Adding to 10013031 its reverse (13031001), we get a palindrome (23044032).
It can be divided in two parts, 100 and 13031, that added together give a palindrome (13131).
The spelling of 10013031 in words is "ten million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •