Base | Representation |
---|---|
bin | 1100000111010101101111… |
… | …0001001101000010010001 |
3 | 1202011101211221210010020210 |
4 | 3001311123301031002101 |
5 | 3221214314200210001 |
6 | 44155121453354333 |
7 | 2543232540103344 |
oct | 301653361150221 |
9 | 52141757703223 |
10 | 13320233210001 |
11 | 4276096431153 |
12 | 15b16731989a9 |
13 | 7581285a6023 |
14 | 3409ba3d845b |
15 | 1817532cadd6 |
hex | c1d5bc4d091 |
13320233210001 has 32 divisors (see below), whose sum is σ = 18385928716288. Its totient is φ = 8571193122240.
The previous prime is 13320233209963. The next prime is 13320233210023. The reversal of 13320233210001 is 10001233202331.
It is not a de Polignac number, because 13320233210001 - 237 = 13182794256529 is a prime.
It is a super-2 number, since 2×133202332100012 (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 13320233210001.
It is not an unprimeable number, because it can be changed into a prime (13320233210041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 145195536 + ... + 145287246.
It is an arithmetic number, because the mean of its divisors is an integer number (574560272384).
Almost surely, 213320233210001 is an apocalyptic number.
It is an amenable number.
13320233210001 is a deficient number, since it is larger than the sum of its proper divisors (5065695506287).
13320233210001 is a wasteful number, since it uses less digits than its factorization.
13320233210001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102181.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13320233210001 its reverse (10001233202331), we get a palindrome (23321466412332).
The spelling of 13320233210001 in words is "thirteen trillion, three hundred twenty billion, two hundred thirty-three million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •