Base | Representation |
---|---|
bin | 10111101010001001001100… |
… | …001100011111010110100110 |
3 | 111122102012012222011002210200 |
4 | 113222021030030133112212 |
5 | 102114233231422233322 |
6 | 1005144235144331330 |
7 | 30626306434352250 |
oct | 2752111414372646 |
9 | 448365188132720 |
10 | 104051156055462 |
11 | 30176935a92430 |
12 | b805989773b46 |
13 | 4609c9c35a785 |
14 | 1b9a162212cd0 |
15 | c069218798ac |
hex | 5ea24c31f5a6 |
104051156055462 has 384 divisors, whose sum is σ = 301425603747840. Its totient is φ = 25125679941120.
The previous prime is 104051156055449. The next prime is 104051156055499. The reversal of 104051156055462 is 264550651150401.
104051156055462 is a `hidden beast` number, since 1 + 0 + 4 + 0 + 51 + 1 + 56 + 0 + 5 + 546 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 463919298 + ... + 464143530.
It is an arithmetic number, because the mean of its divisors is an integer number (784962509760).
Almost surely, 2104051156055462 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104051156055462, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150712801873920).
104051156055462 is an abundant number, since it is smaller than the sum of its proper divisors (197374447692378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104051156055462 is a wasteful number, since it uses less digits than its factorization.
104051156055462 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 224608 (or 224605 counting only the distinct ones).
The product of its (nonzero) digits is 720000, while the sum is 45.
The spelling of 104051156055462 in words is "one hundred four trillion, fifty-one billion, one hundred fifty-six million, fifty-five thousand, four hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •