Base | Representation |
---|---|
bin | 1011111010101001001010… |
… | …0111111111011111101110 |
3 | 1201101112211120212122111020 |
4 | 2332222102213333133232 |
5 | 3204131110203210110 |
6 | 43511005404435010 |
7 | 2521411335146622 |
oct | 276522247773756 |
9 | 51345746778436 |
10 | 13102110210030 |
11 | 41a1634707926 |
12 | 157733a248a66 |
13 | 7406a671c03a |
14 | 33420742d182 |
15 | 17ac38ca3d70 |
hex | bea929ff7ee |
13102110210030 has 32 divisors (see below), whose sum is σ = 31445166643200. Its totient is φ = 3493884707232.
The previous prime is 13102110210023. The next prime is 13102110210041. The reversal of 13102110210030 is 3001201120131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 13102110209991 and 13102110210009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13066911 + ... + 14033829.
It is an arithmetic number, because the mean of its divisors is an integer number (982661457600).
Almost surely, 213102110210030 is an apocalyptic number.
13102110210030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13102110210030 is an abundant number, since it is smaller than the sum of its proper divisors (18343056433170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102110210030 is a wasteful number, since it uses less digits than its factorization.
13102110210030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1418608.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13102110210030 its reverse (3001201120131), we get a palindrome (16103311330161).
The spelling of 13102110210030 in words is "thirteen trillion, one hundred two billion, one hundred ten million, two hundred ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •