Base | Representation |
---|---|
bin | 11000011101010101… |
… | …10011000010011011 |
3 | 1020220010022000102211 |
4 | 30032222303002123 |
5 | 203343014031021 |
6 | 10010550535551 |
7 | 643253450461 |
oct | 141652630233 |
9 | 36803260384 |
10 | 13131002011 |
11 | 5629121186 |
12 | 26656675b7 |
13 | 131357b59a |
14 | 8c7d0a831 |
15 | 51cbcc3e1 |
hex | 30eab309b |
13131002011 has 8 divisors (see below), whose sum is σ = 14635172880. Its totient is φ = 11708137728.
The previous prime is 13131001997. The next prime is 13131002023. The reversal of 13131002011 is 11020013131.
13131002011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13131002011 - 213 = 13130993819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13131001982 and 13131002000.
It is not an unprimeable number, because it can be changed into a prime (13131006011) 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 7 ways as a sum of consecutive naturals, for example, 20326306 + ... + 20326951.
It is an arithmetic number, because the mean of its divisors is an integer number (1829396610).
Almost surely, 213131002011 is an apocalyptic number.
13131002011 is a deficient number, since it is larger than the sum of its proper divisors (1504170869).
13131002011 is a wasteful number, since it uses less digits than its factorization.
13131002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40653293.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 13131002011 its reverse (11020013131), we get a palindrome (24151015142).
The spelling of 13131002011 in words is "thirteen billion, one hundred thirty-one million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •