Base | Representation |
---|---|
bin | 1011111010100101100001… |
… | …0101001110001101011000 |
3 | 1201101110022102121011002010 |
4 | 2332221120111032031120 |
5 | 3204122104321223112 |
6 | 43510324350505520 |
7 | 2521345161250605 |
oct | 276513025161530 |
9 | 51343272534063 |
10 | 13101132211032 |
11 | 41a1182650798 |
12 | 15771068052a0 |
13 | 74057bc15cc8 |
14 | 3341535ab6ac |
15 | 17abccebb63c |
hex | bea5854e358 |
13101132211032 has 16 divisors (see below), whose sum is σ = 32752830527640. Its totient is φ = 4367044070336.
The previous prime is 13101132211009. The next prime is 13101132211033. The reversal of 13101132211032 is 23011223110131.
13101132211032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13101132211033) 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, 272940254373 + ... + 272940254420.
Almost surely, 213101132211032 is an apocalyptic number.
13101132211032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13101132211032 is an abundant number, since it is smaller than the sum of its proper divisors (19651698316608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13101132211032 is a wasteful number, since it uses less digits than its factorization.
13101132211032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 545880508802 (or 545880508798 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13101132211032 its reverse (23011223110131), we get a palindrome (36112355321163).
The spelling of 13101132211032 in words is "thirteen trillion, one hundred one billion, one hundred thirty-two million, two hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •