Base | Representation |
---|---|
bin | 1001011001011101011111… |
… | …1111010101001011001000 |
3 | 1100120211022221012121212202 |
4 | 2112113113333111023020 |
5 | 2323244011113100440 |
6 | 33550531320255332 |
7 | 2114351604146435 |
oct | 226272777251310 |
9 | 40524287177782 |
10 | 10333020050120 |
11 | 3324233489739 |
12 | 11aa737611548 |
13 | 59c526c33911 |
14 | 27a199820b8c |
15 | 12dbbb430615 |
hex | 965d7fd52c8 |
10333020050120 has 32 divisors (see below), whose sum is σ = 23282941043520. Its totient is φ = 4127226521280.
The previous prime is 10333020050117. The next prime is 10333020050149. The reversal of 10333020050120 is 2105002033301.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 10333020050092 and 10333020050101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 186893852 + ... + 186949131.
It is an arithmetic number, because the mean of its divisors is an integer number (727591907610).
Almost surely, 210333020050120 is an apocalyptic number.
10333020050120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10333020050120 is an abundant number, since it is smaller than the sum of its proper divisors (12949920993400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10333020050120 is a wasteful number, since it uses less digits than its factorization.
10333020050120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373843685 (or 373843681 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 10333020050120 its reverse (2105002033301), we get a palindrome (12438022083421).
The spelling of 10333020050120 in words is "ten trillion, three hundred thirty-three billion, twenty million, fifty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •