Base | Representation |
---|---|
bin | 101111111010110110… |
… | …0000011110101001001 |
3 | 100211121201012101210012 |
4 | 1133311230003311021 |
5 | 3141222442401003 |
6 | 115135141201305 |
7 | 10302053254505 |
oct | 1376554036511 |
9 | 324551171705 |
10 | 102906215753 |
11 | 3a707970000 |
12 | 17b3b100235 |
13 | 991c948733 |
14 | 4da3013305 |
15 | 2a244558d8 |
hex | 17f5b03d49 |
102906215753 has 30 divisors (see below), whose sum is σ = 120041419770. Its totient is φ = 87911165760.
The previous prime is 102906215717. The next prime is 102906215767. The reversal of 102906215753 is 357512609201.
It can be written as a sum of positive squares in only one way, i.e., 96852908944 + 6053306809 = 311212^2 + 77803^2 .
It is not a de Polignac number, because 102906215753 - 214 = 102906199369 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102906215753.
It is not an unprimeable number, because it can be changed into a prime (102906215053) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 160040450 + ... + 160041092.
It is an arithmetic number, because the mean of its divisors is an integer number (4001380659).
Almost surely, 2102906215753 is an apocalyptic number.
It is an amenable number.
102906215753 is a deficient number, since it is larger than the sum of its proper divisors (17135204017).
102906215753 is an frugal number, since it uses more digits than its factorization.
102906215753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1347 (or 671 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 41.
The spelling of 102906215753 in words is "one hundred two billion, nine hundred six million, two hundred fifteen thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •