Base | Representation |
---|---|
bin | 1011110100110101000000… |
… | …0111101111110100001011 |
3 | 1201000222222101101222201002 |
4 | 2331031100013233310023 |
5 | 3201012011303310011 |
6 | 43353044413045215 |
7 | 2511243614165426 |
oct | 275152007576413 |
9 | 51028871358632 |
10 | 13002210213131 |
11 | 416322a775617 |
12 | 155bab9a8680b |
13 | 734145854639 |
14 | 32d44b7a09bd |
15 | 17833d71ec3b |
hex | bd3501efd0b |
13002210213131 has 4 divisors (see below), whose sum is σ = 13005487809792. Its totient is φ = 12998932616472.
The previous prime is 13002210213107. The next prime is 13002210213133. The reversal of 13002210213131 is 13131201220031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13002210213131 - 214 = 13002210196747 is a prime.
It is a super-2 number, since 2×130022102131312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13002210213133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1638792380 + ... + 1638800313.
It is an arithmetic number, because the mean of its divisors is an integer number (3251371952448).
Almost surely, 213002210213131 is an apocalyptic number.
13002210213131 is a deficient number, since it is larger than the sum of its proper divisors (3277596661).
13002210213131 is an equidigital number, since it uses as much as digits as its factorization.
13002210213131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3277596660.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13002210213131 its reverse (13131201220031), we get a palindrome (26133411433162).
The spelling of 13002210213131 in words is "thirteen trillion, two billion, two hundred ten million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •