Base | Representation |
---|---|
bin | 1001001001110101010101… |
… | …0011111101111100101010 |
3 | 1022122011100002000022100000 |
4 | 2102131111103331330222 |
5 | 2304344134124003422 |
6 | 33223330302123430 |
7 | 2056065450454350 |
oct | 222352523757452 |
9 | 38564302008300 |
10 | 10064539672362 |
11 | 323039029911a |
12 | 11666a9b80576 |
13 | 58010b26c876 |
14 | 26b1aa8977d0 |
15 | 126c05ebdcac |
hex | 927554fdf2a |
10064539672362 has 96 divisors (see below), whose sum is σ = 25898703667200. Its totient is φ = 2869578994608.
The previous prime is 10064539672339. The next prime is 10064539672367. The reversal of 10064539672362 is 26327693546001.
10064539672362 is a `hidden beast` number, since 1 + 0 + 0 + 6 + 4 + 539 + 6 + 72 + 36 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 10064539672299 and 10064539672308.
It is not an unprimeable number, because it can be changed into a prime (10064539672367) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1458562 + ... + 4717677.
It is an arithmetic number, because the mean of its divisors is an integer number (269778163200).
Almost surely, 210064539672362 is an apocalyptic number.
10064539672362 is an abundant number, since it is smaller than the sum of its proper divisors (15834163994838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10064539672362 is an equidigital number, since it uses as much as digits as its factorization.
10064539672362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6176742 (or 6176730 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 54.
The spelling of 10064539672362 in words is "ten trillion, sixty-four billion, five hundred thirty-nine million, six hundred seventy-two thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •