Base | Representation |
---|---|
bin | 1011110101111100001010… |
… | …1100000011011001011100 |
3 | 1201002211021122011120201121 |
4 | 2331133002230003121130 |
5 | 3201320121410433312 |
6 | 43405524103020324 |
7 | 2512521153340150 |
oct | 275370254033134 |
9 | 51084248146647 |
10 | 13021312202332 |
11 | 4170342300855 |
12 | 156374b13a6a4 |
13 | 735b9b181125 |
14 | 3303406c7060 |
15 | 178aaa703707 |
hex | bd7c2b0365c |
13021312202332 has 24 divisors (see below), whose sum is σ = 26104778663040. Its totient is φ = 5567243602800.
The previous prime is 13021312202309. The next prime is 13021312202341. The reversal of 13021312202332 is 23320221312031.
It is a junction number, because it is equal to n+sod(n) for n = 13021312202297 and 13021312202306.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 554936794 + ... + 554960257.
It is an arithmetic number, because the mean of its divisors is an integer number (1087699110960).
Almost surely, 213021312202332 is an apocalyptic number.
It is an amenable number.
13021312202332 is an abundant number, since it is smaller than the sum of its proper divisors (13083466460708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13021312202332 is a wasteful number, since it uses less digits than its factorization.
13021312202332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1109897481 (or 1109897479 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13021312202332 its reverse (23320221312031), we get a palindrome (36341533514363).
The spelling of 13021312202332 in words is "thirteen trillion, twenty-one billion, three hundred twelve million, two hundred two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •