Base | Representation |
---|---|
bin | 101111110101000110… |
… | …1101100001001100100 |
3 | 100211010021221211202112 |
4 | 1133222031230021210 |
5 | 3140324202030220 |
6 | 115104103100152 |
7 | 10264225042031 |
oct | 1375215541144 |
9 | 324107854675 |
10 | 102713705060 |
11 | 3a61923295a |
12 | 17aa6741658 |
13 | 98bbab4295 |
14 | 4d85620388 |
15 | 2a125ca5c5 |
hex | 17ea36c264 |
102713705060 has 24 divisors (see below), whose sum is σ = 220288118400. Its totient is φ = 40211322464.
The previous prime is 102713705053. The next prime is 102713705069. The reversal of 102713705060 is 60507317201.
It is not an unprimeable number, because it can be changed into a prime (102713705069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54634010 + ... + 54635889.
It is an arithmetic number, because the mean of its divisors is an integer number (9178671600).
Almost surely, 2102713705060 is an apocalyptic number.
102713705060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102713705060 is an abundant number, since it is smaller than the sum of its proper divisors (117574413340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102713705060 is a wasteful number, since it uses less digits than its factorization.
102713705060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109269955 (or 109269953 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 32.
The spelling of 102713705060 in words is "one hundred two billion, seven hundred thirteen million, seven hundred five thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •