Base | Representation |
---|---|
bin | 1011110101111110101111… |
… | …1000000010011110001001 |
3 | 1201002220001210102102012200 |
4 | 2331133223320002132021 |
5 | 3201323030310210441 |
6 | 43410120425430413 |
7 | 2512544243660133 |
oct | 275375370023611 |
9 | 51086053372180 |
10 | 13022003210121 |
11 | 4170667369174 |
12 | 156390263b409 |
13 | 735c7b392589 |
14 | 3303a83a0053 |
15 | 178aeb1eb7b6 |
hex | bd7ebe02789 |
13022003210121 has 24 divisors (see below), whose sum is σ = 19119490131456. Its totient is φ = 8538314358240.
The previous prime is 13022003210101. The next prime is 13022003210123. The reversal of 13022003210121 is 12101230022031.
13022003210121 is a `hidden beast` number, since 1 + 3 + 0 + 220 + 0 + 321 + 0 + 121 = 666.
It is not a de Polignac number, because 13022003210121 - 225 = 13021969655689 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13022003210094 and 13022003210103.
It is not an unprimeable number, because it can be changed into a prime (13022003210123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5727576 + ... + 7671318.
It is an arithmetic number, because the mean of its divisors is an integer number (796645422144).
Almost surely, 213022003210121 is an apocalyptic number.
It is an amenable number.
13022003210121 is a deficient number, since it is larger than the sum of its proper divisors (6097486921335).
13022003210121 is a wasteful number, since it uses less digits than its factorization.
13022003210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1956013 (or 1956010 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13022003210121 its reverse (12101230022031), we get a palindrome (25123233232152).
The spelling of 13022003210121 in words is "thirteen trillion, twenty-two billion, three million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •