Base | Representation |
---|---|
bin | 1001001110100101001011… |
… | …0101011101111100000101 |
3 | 1022220221212022212022100202 |
4 | 2103221102311131330011 |
5 | 2312213204220014000 |
6 | 33325015524420245 |
7 | 2065013610202133 |
oct | 223512265357405 |
9 | 38827768768322 |
10 | 10146102501125 |
11 | 3261a35398618 |
12 | 117a471247685 |
13 | 587a090c4316 |
14 | 27110700c753 |
15 | 128dcb797dd5 |
hex | 93a52d5df05 |
10146102501125 has 16 divisors (see below), whose sum is σ = 12762039373824. Its totient is φ = 8052969531600.
The previous prime is 10146102501089. The next prime is 10146102501187. The reversal of 10146102501125 is 52110520164101.
It is not a de Polignac number, because 10146102501125 - 228 = 10145834065669 is a prime.
It is a super-3 number, since 3×101461025011253 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 319546409 + ... + 319578158.
It is an arithmetic number, because the mean of its divisors is an integer number (797627460864).
Almost surely, 210146102501125 is an apocalyptic number.
It is an amenable number.
10146102501125 is a deficient number, since it is larger than the sum of its proper divisors (2615936872699).
10146102501125 is an equidigital number, since it uses as much as digits as its factorization.
10146102501125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639124709 (or 639124699 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 29.
Adding to 10146102501125 its reverse (52110520164101), we get a palindrome (62256622665226).
The spelling of 10146102501125 in words is "ten trillion, one hundred forty-six billion, one hundred two million, five hundred one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •