Base | Representation |
---|---|
bin | 1011110101111111100001… |
… | …1000110010100100011011 |
3 | 1201002220121102102001121222 |
4 | 2331133320120302210123 |
5 | 3201323443024403311 |
6 | 43410153324522255 |
7 | 2512552403130110 |
oct | 275377030624433 |
9 | 51086542361558 |
10 | 13022213122331 |
11 | 4170764901336 |
12 | 15639609b038b |
13 | 735cb2a0a49a |
14 | 3303c8202907 |
15 | 178b0e862adb |
hex | bd7f863291b |
13022213122331 has 16 divisors (see below), whose sum is σ = 15209181081600. Its totient is φ = 10919500589088.
The previous prime is 13022213122327. The next prime is 13022213122337. The reversal of 13022213122331 is 13322131222031.
It is not a de Polignac number, because 13022213122331 - 22 = 13022213122327 is a prime.
It is a super-2 number, since 2×130222131223312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13022213122331.
It is not an unprimeable number, because it can be changed into a prime (13022213122337) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107959475 + ... + 108080028.
It is an arithmetic number, because the mean of its divisors is an integer number (950573817600).
Almost surely, 213022213122331 is an apocalyptic number.
13022213122331 is a deficient number, since it is larger than the sum of its proper divisors (2186967959269).
13022213122331 is a wasteful number, since it uses less digits than its factorization.
13022213122331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216039698.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 13022213122331 its reverse (13322131222031), we get a palindrome (26344344344362).
The spelling of 13022213122331 in words is "thirteen trillion, twenty-two billion, two hundred thirteen million, one hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •