Base | Representation |
---|---|
bin | 110001100110… |
… | …000100111110 |
3 | 220110112001100 |
4 | 301212010332 |
5 | 11312013042 |
6 | 1142353530 |
7 | 215335566 |
oct | 61460476 |
9 | 26415040 |
10 | 13001022 |
11 | 737a951 |
12 | 442b8a6 |
13 | 2902818 |
14 | 1a25da6 |
15 | 121c24c |
hex | c6613e |
13001022 has 24 divisors (see below), whose sum is σ = 29826576. Its totient is φ = 4078656.
The previous prime is 13000993. The next prime is 13001029. The reversal of 13001022 is 22010031.
It is a happy number.
13001022 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 13000995 and 13001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13001029) 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, 20938 + ... + 21549.
It is an arithmetic number, because the mean of its divisors is an integer number (1242774).
Almost surely, 213001022 is an apocalyptic number.
13001022 is an abundant number, since it is smaller than the sum of its proper divisors (16825554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13001022 is a wasteful number, since it uses less digits than its factorization.
13001022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42512 (or 42509 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 13001022 is about 3605.6929985788. The cubic root of 13001022 is about 235.1396303133.
Adding to 13001022 its reverse (22010031), we get a palindrome (35011053).
Subtracting 13001022 from its reverse (22010031), we obtain a palindrome (9009009).
The spelling of 13001022 in words is "thirteen million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •