Base | Representation |
---|---|
bin | 101111110001010111111001… |
… | …011111111111101001111101 |
3 | 1000112220110122222110222100110 |
4 | 233301113321133333221331 |
5 | 210014244023342214123 |
6 | 2022503040254420233 |
7 | 62153206101301161 |
oct | 5761277137775175 |
9 | 1015813588428313 |
10 | 210101101132413 |
11 | 60a434162a0557 |
12 | 1b693001801679 |
13 | 90305ab0b307a |
14 | 39c4d3a128ca1 |
15 | 1945329c28493 |
hex | bf15f97ffa7d |
210101101132413 has 16 divisors (see below), whose sum is σ = 284728706107200. Its totient is φ = 137770473146880.
The previous prime is 210101101132397. The next prime is 210101101132457. The reversal of 210101101132413 is 314231101101012.
It is a happy number.
It is not a de Polignac number, because 210101101132413 - 24 = 210101101132397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210101101132413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210101101134413) 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, 32140018 + ... + 38120636.
It is an arithmetic number, because the mean of its divisors is an integer number (17795544131700).
Almost surely, 2210101101132413 is an apocalyptic number.
It is an amenable number.
210101101132413 is a deficient number, since it is larger than the sum of its proper divisors (74627604974787).
210101101132413 is a wasteful number, since it uses less digits than its factorization.
210101101132413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6172652.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 210101101132413 its reverse (314231101101012), we get a palindrome (524332202233425).
The spelling of 210101101132413 in words is "two hundred ten trillion, one hundred one billion, one hundred one million, one hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •