Base | Representation |
---|---|
bin | 1001011001011101110101… |
… | …1000000010001101101100 |
3 | 1100120211120020020111021020 |
4 | 2112113131120002031230 |
5 | 2323244202231142030 |
6 | 33550544305134140 |
7 | 2114354052210525 |
oct | 226273530021554 |
9 | 40524506214236 |
10 | 10333110412140 |
11 | 332427a497a9a |
12 | 11aa76192a350 |
13 | 59c53c881579 |
14 | 27a1a782384c |
15 | 12dbc432e510 |
hex | 965dd60236c |
10333110412140 has 48 divisors (see below), whose sum is σ = 28932866868192. Its totient is φ = 2755481089536.
The previous prime is 10333110412123. The next prime is 10333110412153. The reversal of 10333110412140 is 4121401133301.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10333110412140.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14659062 + ... + 15347778.
It is an arithmetic number, because the mean of its divisors is an integer number (602768059754).
Almost surely, 210333110412140 is an apocalyptic number.
10333110412140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10333110412140 is an abundant number, since it is smaller than the sum of its proper divisors (18599756456052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10333110412140 is a wasteful number, since it uses less digits than its factorization.
10333110412140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938786 (or 938784 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10333110412140 its reverse (4121401133301), we get a palindrome (14454511545441).
The spelling of 10333110412140 in words is "ten trillion, three hundred thirty-three billion, one hundred ten million, four hundred twelve thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •