Base | Representation |
---|---|
bin | 1100000010010001111110… |
… | …0001000110011111010001 |
3 | 1201212002112000220111220111 |
4 | 3000210133201012133101 |
5 | 3213303321142310001 |
6 | 44051145450241321 |
7 | 2534035036433143 |
oct | 300443741063721 |
9 | 51762460814814 |
10 | 13233323010001 |
11 | 4242247935586 |
12 | 1598859126241 |
13 | 74cb8794a193 |
14 | 33a6d39dac93 |
15 | 17e368330851 |
hex | c091f8467d1 |
13233323010001 has 8 divisors (see below), whose sum is σ = 13770584451360. Its totient is φ = 12706493829792.
The previous prime is 13233323009923. The next prime is 13233323010053. The reversal of 13233323010001 is 10001032333231.
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 13233323010001 - 27 = 13233323009873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13233323010601) 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, 2608062700 + ... + 2608067773.
It is an arithmetic number, because the mean of its divisors is an integer number (1721323056420).
Almost surely, 213233323010001 is an apocalyptic number.
It is an amenable number.
13233323010001 is a deficient number, since it is larger than the sum of its proper divisors (537261441359).
13233323010001 is an equidigital number, since it uses as much as digits as its factorization.
13233323010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5216130575.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13233323010001 its reverse (10001032333231), we get a palindrome (23234355343232).
It can be divided in two parts, 132333230 and 10001, that added together give a palindrome (132343231).
The spelling of 13233323010001 in words is "thirteen trillion, two hundred thirty-three billion, three hundred twenty-three million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •