Base | Representation |
---|---|
bin | 10111110100001111111101… |
… | …110011100100000000000000 |
3 | 111201212120202202010020212211 |
4 | 113310033331303210000000 |
5 | 102212123020123200000 |
6 | 1010435250501031504 |
7 | 31030423151161030 |
oct | 2764177563440000 |
9 | 451776682106784 |
10 | 104745625600000 |
11 | 30414408a35a80 |
12 | b8b84a20b5594 |
13 | 465a615aac658 |
14 | 1bc1a02c138c0 |
15 | c19a1a1487ba |
hex | 5f43fdce4000 |
104745625600000 has 1080 divisors, whose sum is σ = 328464056079936. Its totient is φ = 32447692800000.
The previous prime is 104745625599991. The next prime is 104745625600069. The reversal of 104745625600000 is 6526547401.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 642611199919 + ... + 642611200081.
Almost surely, 2104745625600000 is an apocalyptic number.
104745625600000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104745625600000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164232028039968).
104745625600000 is an abundant number, since it is smaller than the sum of its proper divisors (223718430479936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104745625600000 is an frugal number, since it uses more digits than its factorization.
104745625600000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 397 (or 188 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 40.
The spelling of 104745625600000 in words is "one hundred four trillion, seven hundred forty-five billion, six hundred twenty-five million, six hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •