Base | Representation |
---|---|
bin | 101101101100111101000011… |
… | …000101100000100111100110 |
3 | 222100200112111012020111022220 |
4 | 231230331003011200213212 |
5 | 202321201130300101202 |
6 | 1551254420015333210 |
7 | 60223602410026611 |
oct | 5554750305404746 |
9 | 870615435214286 |
10 | 201001300003302 |
11 | 59055199838a37 |
12 | 1a663494821206 |
13 | 8820458994036 |
14 | 378c72c98d178 |
15 | 18387899e6abc |
hex | b6cf431609e6 |
201001300003302 has 8 divisors (see below), whose sum is σ = 402002600006616. Its totient is φ = 67000433334432.
The previous prime is 201001300003297. The next prime is 201001300003391. The reversal of 201001300003302 is 203300003100102.
201001300003302 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
201001300003302 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16750108333603 + ... + 16750108333614.
It is an arithmetic number, because the mean of its divisors is an integer number (50250325000827).
Almost surely, 2201001300003302 is an apocalyptic number.
201001300003302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201001300003302 is a wasteful number, since it uses less digits than its factorization.
201001300003302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33500216667222.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 201001300003302 its reverse (203300003100102), we get a palindrome (404301303103404).
The spelling of 201001300003302 in words is "two hundred one trillion, one billion, three hundred million, three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •