Base | Representation |
---|---|
bin | 11011010010001110101101… |
… | …01011111100000000011100 |
3 | 21212102221111011101112000021 |
4 | 31221013112223330000130 |
5 | 30331020000000000103 |
6 | 331335341450241524 |
7 | 15431566635065464 |
oct | 1551072653740034 |
9 | 255387434345007 |
10 | 60000000000028 |
11 | 18132947892130 |
12 | 689049a7262a4 |
13 | 2762c8b87b4ca |
14 | 10b6030736ba4 |
15 | 6e0b0eaa2bbd |
hex | 3691d6afc01c |
60000000000028 has 12 divisors (see below), whose sum is σ = 114545454545592. Its totient is φ = 27272727272720.
The previous prime is 60000000000013. The next prime is 60000000000029. The reversal of 60000000000028 is 82000000000006.
60000000000028 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 59999999999921 and 60000000000020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60000000000029) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 681818181775 + ... + 681818181862.
It is an arithmetic number, because the mean of its divisors is an integer number (9545454545466).
Almost surely, 260000000000028 is an apocalyptic number.
It is an amenable number.
60000000000028 is a deficient number, since it is larger than the sum of its proper divisors (54545454545564).
60000000000028 is a wasteful number, since it uses less digits than its factorization.
60000000000028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363636363652 (or 1363636363650 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
The spelling of 60000000000028 in words is "sixty trillion, twenty-eight", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •