Base | Representation |
---|---|
bin | 1001000110110101011010… |
… | …0011110101110111100001 |
3 | 1022110020100122112202022101 |
4 | 2101231112203311313201 |
5 | 2303023131334100413 |
6 | 33143530210210401 |
7 | 2052262665136663 |
oct | 221552643656741 |
9 | 38406318482271 |
10 | 10013021003233 |
11 | 3210553354516 |
12 | 1158710583a01 |
13 | 5782ba9a2171 |
14 | 2688c05a4533 |
15 | 1256dd142edd |
hex | 91b568f5de1 |
10013021003233 has 16 divisors (see below), whose sum is σ = 10464170685696. Its totient is φ = 9563190436800.
The previous prime is 10013021003173. The next prime is 10013021003267. The reversal of 10013021003233 is 33230012031001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10013021003233 is a prime.
It is a super-2 number, since 2×100130210032332 (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 10013021003233.
It is not an unprimeable number, because it can be changed into a prime (10013021003273) 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, 279184060 + ... + 279219922.
It is an arithmetic number, because the mean of its divisors is an integer number (654010667856).
Almost surely, 210013021003233 is an apocalyptic number.
It is an amenable number.
10013021003233 is a deficient number, since it is larger than the sum of its proper divisors (451149682463).
10013021003233 is a wasteful number, since it uses less digits than its factorization.
10013021003233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53904.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10013021003233 its reverse (33230012031001), we get a palindrome (43243033034234).
The spelling of 10013021003233 in words is "ten trillion, thirteen billion, twenty-one million, three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •