Base | Representation |
---|---|
bin | 11000001101110101… |
… | …11000010010111001 |
3 | 1020120001200020101000 |
4 | 30012322320102321 |
5 | 203111224000441 |
6 | 5550024315213 |
7 | 640114451304 |
oct | 140672702271 |
9 | 36501606330 |
10 | 13001000121 |
11 | 55717a88aa |
12 | 262a012b09 |
13 | 12c2661ca5 |
14 | 8b4949b3b |
15 | 51159d2b6 |
hex | 306eb84b9 |
13001000121 has 64 divisors (see below), whose sum is σ = 21144499200. Its totient is φ = 7858464768.
The previous prime is 13001000071. The next prime is 13001000147. The reversal of 13001000121 is 12100010031.
13001000121 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 13001000121 - 26 = 13001000057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13001000161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8212096 + ... + 8213678.
It is an arithmetic number, because the mean of its divisors is an integer number (330382800).
Almost surely, 213001000121 is an apocalyptic number.
It is an amenable number.
13001000121 is a deficient number, since it is larger than the sum of its proper divisors (8143499079).
13001000121 is a wasteful number, since it uses less digits than its factorization.
13001000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2255 (or 2249 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 13001000121 its reverse (12100010031), we get a palindrome (25101010152).
The spelling of 13001000121 in words is "thirteen billion, one million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •