Base | Representation |
---|---|
bin | 1011110110100000101011… |
… | …0000010001010100110110 |
3 | 1201010202120112201100101000 |
4 | 2331220022300101110312 |
5 | 3202000203431431402 |
6 | 43414224305344130 |
7 | 2513316040430460 |
oct | 275501260212466 |
9 | 51122515640330 |
10 | 13031111202102 |
11 | 417451060a374 |
12 | 1565624938046 |
13 | 736aa0323c46 |
14 | 3309cdc87130 |
15 | 178e80b0ac1c |
hex | bda0ac11536 |
13031111202102 has 32 divisors (see below), whose sum is σ = 33094885593600. Its totient is φ = 3723174629064.
The previous prime is 13031111202101. The next prime is 13031111202113. The reversal of 13031111202102 is 20120211113031.
13031111202102 is a `hidden beast` number, since 1 + 30 + 311 + 112 + 0 + 210 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031111202101) 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, 17236919202 + ... + 17236919957.
It is an arithmetic number, because the mean of its divisors is an integer number (1034215174800).
Almost surely, 213031111202102 is an apocalyptic number.
13031111202102 is an abundant number, since it is smaller than the sum of its proper divisors (20063774391498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13031111202102 is a wasteful number, since it uses less digits than its factorization.
13031111202102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34473839177 (or 34473839171 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 13031111202102 its reverse (20120211113031), we get a palindrome (33151322315133).
The spelling of 13031111202102 in words is "thirteen trillion, thirty-one billion, one hundred eleven million, two hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •