Base | Representation |
---|---|
bin | 1011110101010101111000… |
… | …0001001111001000101111 |
3 | 1201001211202021122100202012 |
4 | 2331111132001033020233 |
5 | 3201133044012301111 |
6 | 43401104114551435 |
7 | 2512005351320123 |
oct | 275253601171057 |
9 | 51054667570665 |
10 | 13011033322031 |
11 | 4166a48127958 |
12 | 156176089857b |
13 | 734c2077bb34 |
14 | 32da474cb583 |
15 | 1786a810948b |
hex | bd55e04f22f |
13011033322031 has 16 divisors (see below), whose sum is σ = 13244481331200. Its totient is φ = 12778022164608.
The previous prime is 13011033321977. The next prime is 13011033322069. The reversal of 13011033322031 is 13022333011031.
It is a cyclic number.
It is not a de Polignac number, because 13011033322031 - 210 = 13011033321007 is a prime.
It is a super-2 number, since 2×130110333220312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13011033321988 and 13011033322006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13011033322081) 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, 268893266 + ... + 268941648.
It is an arithmetic number, because the mean of its divisors is an integer number (827780083200).
Almost surely, 213011033322031 is an apocalyptic number.
13011033322031 is a deficient number, since it is larger than the sum of its proper divisors (233448009169).
13011033322031 is a wasteful number, since it uses less digits than its factorization.
13011033322031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52798.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 13011033322031 its reverse (13022333011031), we get a palindrome (26033366333062).
The spelling of 13011033322031 in words is "thirteen trillion, eleven billion, thirty-three million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.194 sec. • engine limits •