Base | Representation |
---|---|
bin | 101110101010100111… |
… | …1010011111110000101 |
3 | 100120200002221012001022 |
4 | 1131111033103332011 |
5 | 3120214331401000 |
6 | 114012100440525 |
7 | 10145255465045 |
oct | 1352517237605 |
9 | 316602835038 |
10 | 100214325125 |
11 | 39556412802 |
12 | 175096a9145 |
13 | 95b1041145 |
14 | 4bc96d1725 |
15 | 2917e73585 |
hex | 17553d3f85 |
100214325125 has 16 divisors (see below), whose sum is σ = 125169268224. Its totient is φ = 80106210000.
The previous prime is 100214325121. The next prime is 100214325137. The reversal of 100214325125 is 521523412001.
It is not a de Polignac number, because 100214325125 - 22 = 100214325121 is a prime.
It is a super-3 number, since 3×1002143251253 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100214325094 and 100214325103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100214325121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 171761 + ... + 479510.
It is an arithmetic number, because the mean of its divisors is an integer number (7823079264).
Almost surely, 2100214325125 is an apocalyptic number.
It is an amenable number.
100214325125 is a deficient number, since it is larger than the sum of its proper divisors (24954943099).
100214325125 is an equidigital number, since it uses as much as digits as its factorization.
100214325125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 652517 (or 652507 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 100214325125 its reverse (521523412001), we get a palindrome (621737737126).
The spelling of 100214325125 in words is "one hundred billion, two hundred fourteen million, three hundred twenty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •