Base | Representation |
---|---|
bin | 1011111010101001001000… |
… | …1001001000101100001111 |
3 | 1201101112211000122200202002 |
4 | 2332222102021020230033 |
5 | 3204131101120334411 |
6 | 43511004515222515 |
7 | 2521411206330254 |
oct | 276522211105417 |
9 | 51345730580662 |
10 | 13102102121231 |
11 | 41a1630092672 |
12 | 15773375a7a3b |
13 | 7406a4b49376 |
14 | 33420632542b |
15 | 17ac3820733b |
hex | bea92248b0f |
13102102121231 has 8 divisors (see below), whose sum is σ = 13106760352224. Its totient is φ = 13097444532480.
The previous prime is 13102102121209. The next prime is 13102102121239. The reversal of 13102102121231 is 13212120120131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13102102121231 - 210 = 13102102120207 is a prime.
It is a super-2 number, since 2×131021021212312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102102121239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42658571 + ... + 42964611.
It is an arithmetic number, because the mean of its divisors is an integer number (1638345044028).
Almost surely, 213102102121231 is an apocalyptic number.
13102102121231 is a deficient number, since it is larger than the sum of its proper divisors (4658230993).
13102102121231 is a wasteful number, since it uses less digits than its factorization.
13102102121231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321121.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13102102121231 its reverse (13212120120131), we get a palindrome (26314222241362).
The spelling of 13102102121231 in words is "thirteen trillion, one hundred two billion, one hundred two million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •