Base | Representation |
---|---|
bin | 1011110101111110110011… |
… | …1101000011010001010011 |
3 | 1201002220010001110112200111 |
4 | 2331133230331003101103 |
5 | 3201323044423120311 |
6 | 43410122313302151 |
7 | 2512544553516160 |
oct | 275375475032123 |
9 | 51086101415614 |
10 | 13022021301331 |
11 | 41706765a5389 |
12 | 1563908704957 |
13 | 735c82057c33 |
14 | 3303aa94d067 |
15 | 178aecac1d21 |
hex | bd7ecf43453 |
13022021301331 has 8 divisors (see below), whose sum is σ = 14910765722624. Its totient is φ = 11140390796040.
The previous prime is 13022021301313. The next prime is 13022021301337. The reversal of 13022021301331 is 13310312022031.
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 13022021301331 - 225 = 13021987746899 is a prime.
It is a super-2 number, since 2×130220213013312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13022021301337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1778475075 + ... + 1778482396.
It is an arithmetic number, because the mean of its divisors is an integer number (1863845715328).
Almost surely, 213022021301331 is an apocalyptic number.
13022021301331 is a deficient number, since it is larger than the sum of its proper divisors (1888744421293).
13022021301331 is an equidigital number, since it uses as much as digits as its factorization.
13022021301331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3556958001.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13022021301331 its reverse (13310312022031), we get a palindrome (26332333323362).
The spelling of 13022021301331 in words is "thirteen trillion, twenty-two billion, twenty-one million, three hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •