Base | Representation |
---|---|
bin | 1001000111010000100010… |
… | …0110100010000011001001 |
3 | 1022110221011010221112200201 |
4 | 2101310020212202003021 |
5 | 2303133040033121413 |
6 | 33151132541132201 |
7 | 2052641310230152 |
oct | 221641046420311 |
9 | 38427133845621 |
10 | 10020303020233 |
11 | 321364a90a690 |
12 | 115a00325a061 |
13 | 578bab54a86c |
14 | 268db1772929 |
15 | 1259b75b79dd |
hex | 91d089a20c9 |
10020303020233 has 8 divisors (see below), whose sum is σ = 10931847942240. Its totient is φ = 9108859478880.
The previous prime is 10020303020213. The next prime is 10020303020257. The reversal of 10020303020233 is 33202030302001.
It is a happy number.
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 10020303020233 - 25 = 10020303020201 is a prime.
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 10020303020233.
It is not an unprimeable number, because it can be changed into a prime (10020303020213) 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, 25138423 + ... + 25533916.
It is an arithmetic number, because the mean of its divisors is an integer number (1366480992780).
Almost surely, 210020303020233 is an apocalyptic number.
It is an amenable number.
10020303020233 is a deficient number, since it is larger than the sum of its proper divisors (911544922007).
10020303020233 is a wasteful number, since it uses less digits than its factorization.
10020303020233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50690327.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 10020303020233 its reverse (33202030302001), we get a palindrome (43222333322234).
The spelling of 10020303020233 in words is "ten trillion, twenty billion, three hundred three million, twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •