Base | Representation |
---|---|
bin | 1100000111011100011001… |
… | …0101001100100011011111 |
3 | 1202011120110112212210101102 |
4 | 3001313012111030203133 |
5 | 3221231444340430421 |
6 | 44200015120503315 |
7 | 2543325046242023 |
oct | 301670625144337 |
9 | 52146415783342 |
10 | 13322021030111 |
11 | 4276923626932 |
12 | 15b1a91a7ab3b |
13 | 758351ac0251 |
14 | 340b09a20383 |
15 | 18180a22a60b |
hex | c1dc654c8df |
13322021030111 has 8 divisors (see below), whose sum is σ = 13902408087264. Its totient is φ = 12741731368960.
The previous prime is 13322021030099. The next prime is 13322021030117. The reversal of 13322021030111 is 11103012022331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13322021030111 - 222 = 13322016835807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13322021030117) by changing a digit.
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, 24069410 + ... + 24616671.
It is an arithmetic number, because the mean of its divisors is an integer number (1737801010908).
Almost surely, 213322021030111 is an apocalyptic number.
13322021030111 is a deficient number, since it is larger than the sum of its proper divisors (580387057153).
13322021030111 is a wasteful number, since it uses less digits than its factorization.
13322021030111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48698001.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13322021030111 its reverse (11103012022331), we get a palindrome (24425033052442).
The spelling of 13322021030111 in words is "thirteen trillion, three hundred twenty-two billion, twenty-one million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.312 sec. • engine limits •