Base | Representation |
---|---|
bin | 1011110101111111111101… |
… | …1011010000110111001010 |
3 | 1201002220220122121121010011 |
4 | 2331133333123100313022 |
5 | 3201324213242224320 |
6 | 43410213143542134 |
7 | 2512555335641416 |
oct | 275377733206712 |
9 | 51086818547104 |
10 | 13022331211210 |
11 | 4170815528252 |
12 | 156399445a94a |
13 | 736001315569 |
14 | 3303d9b81d46 |
15 | 178b19ddc05a |
hex | bd7ff6d0dca |
13022331211210 has 8 divisors (see below), whose sum is σ = 23440196180196. Its totient is φ = 5208932484480.
The previous prime is 13022331211207. The next prime is 13022331211243. The reversal of 13022331211210 is 1211213322031.
It can be written as a sum of positive squares in 2 ways, for example, as 10733401258969 + 2288929952241 = 3276187^2 + 1512921^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×130223312112102 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 651116560551 + ... + 651116560570.
Almost surely, 213022331211210 is an apocalyptic number.
13022331211210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13022331211210 is a deficient number, since it is larger than the sum of its proper divisors (10417864968986).
13022331211210 is a wasteful number, since it uses less digits than its factorization.
13022331211210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1302233121128.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13022331211210 its reverse (1211213322031), we get a palindrome (14233544533241).
The spelling of 13022331211210 in words is "thirteen trillion, twenty-two billion, three hundred thirty-one million, two hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •