Base | Representation |
---|---|
bin | 1001010001101110000101… |
… | …0110110001000010011010 |
3 | 1100010010001211222210100201 |
4 | 2110123201112301002122 |
5 | 2314104131444433310 |
6 | 33405455222452414 |
7 | 2101633221455146 |
oct | 224334126610232 |
9 | 40103054883321 |
10 | 10200033202330 |
11 | 328289a912664 |
12 | 1188a0259410a |
13 | 58cb2230113a |
14 | 2739817b4226 |
15 | 12a4d6274e3a |
hex | 946e15b109a |
10200033202330 has 8 divisors (see below), whose sum is σ = 18360059764212. Its totient is φ = 4080013280928.
The previous prime is 10200033202313. The next prime is 10200033202399. The reversal of 10200033202330 is 3320233000201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 9804106584801 + 395926617529 = 3131151^2 + 629227^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10200033202298 and 10200033202307.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 510001660107 + ... + 510001660126.
Almost surely, 210200033202330 is an apocalyptic number.
10200033202330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10200033202330 is a deficient number, since it is larger than the sum of its proper divisors (8160026561882).
10200033202330 is a wasteful number, since it uses less digits than its factorization.
10200033202330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020003320240.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 10200033202330 its reverse (3320233000201), we get a palindrome (13520266202531).
The spelling of 10200033202330 in words is "ten trillion, two hundred billion, thirty-three million, two hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •