Base | Representation |
---|---|
bin | 10010111000111001… |
… | …11110110010100000 |
3 | 222011202010222201002 |
4 | 21130130332302200 |
5 | 131232101120210 |
6 | 4354141331132 |
7 | 506206244456 |
oct | 113434766240 |
9 | 28152128632 |
10 | 10141035680 |
11 | 4334394226 |
12 | 1b70266aa8 |
13 | c57c9b039 |
14 | 6c2b969d6 |
15 | 3e546b4a5 |
hex | 25c73eca0 |
10141035680 has 48 divisors (see below), whose sum is σ = 25219162080. Its totient is φ = 3842917632.
The previous prime is 10141035679. The next prime is 10141035689. The reversal of 10141035680 is 8653014101.
10141035680 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (10141035689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1664894 + ... + 1670973.
It is an arithmetic number, because the mean of its divisors is an integer number (525399210).
Almost surely, 210141035680 is an apocalyptic number.
10141035680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10141035680 is an abundant number, since it is smaller than the sum of its proper divisors (15078126400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10141035680 is a wasteful number, since it uses less digits than its factorization.
10141035680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3335901 (or 3335893 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 10141035680 its reverse (8653014101), we get a palindrome (18794049781).
The spelling of 10141035680 in words is "ten billion, one hundred forty-one million, thirty-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •