Base | Representation |
---|---|
bin | 1011110101111011000011… |
… | …0011101011010101001110 |
3 | 1201002210111201200110000100 |
4 | 2331132300303223111032 |
5 | 3201314013111223042 |
6 | 43405434225111530 |
7 | 2512510551425004 |
oct | 275366063532516 |
9 | 51083451613010 |
10 | 13021012211022 |
11 | 41701a8a32952 |
12 | 15636867885a6 |
13 | 735b50c8728a |
14 | 330312916a74 |
15 | 178a8e1e724c |
hex | bd7b0ceb54e |
13021012211022 has 48 divisors (see below), whose sum is σ = 29894766213312. Its totient is φ = 4081873720320.
The previous prime is 13021012210967. The next prime is 13021012211041. The reversal of 13021012211022 is 22011221012031.
13021012211022 is a `hidden beast` number, since 130 + 210 + 1 + 221 + 102 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 13021012210986 and 13021012211004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16007254 + ... + 16801017.
It is an arithmetic number, because the mean of its divisors is an integer number (622807629444).
Almost surely, 213021012211022 is an apocalyptic number.
13021012211022 is an abundant number, since it is smaller than the sum of its proper divisors (16873754002290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13021012211022 is a wasteful number, since it uses less digits than its factorization.
13021012211022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32809593 (or 32809590 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 13021012211022 its reverse (22011221012031), we get a palindrome (35032233223053).
The spelling of 13021012211022 in words is "thirteen trillion, twenty-one billion, twelve million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •