Base | Representation |
---|---|
bin | 111000110100100000… |
… | …000100000010010000 |
3 | 12211110220202112120000 |
4 | 320310200010002100 |
5 | 1444422123100022 |
6 | 44005555450000 |
7 | 4256615345001 |
oct | 706440040220 |
9 | 184426675500 |
10 | 61010362512 |
11 | 23968839400 |
12 | b9a82b6900 |
13 | 59a3b84c28 |
14 | 2d4ab3b1a8 |
15 | 18c12ce6ac |
hex | e34804090 |
61010362512 has 150 divisors (see below), whose sum is σ = 194094422214. Its totient is φ = 18487941120.
The previous prime is 61010362507. The next prime is 61010362531. The reversal of 61010362512 is 21526301016.
61010362512 is a `hidden beast` number, since 6 + 10 + 10 + 3 + 625 + 12 = 666.
It can be written as a sum of positive squares in only one way, i.e., 45052609536 + 15957752976 = 212256^2 + 126324^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 37713 + ... + 351344.
Almost surely, 261010362512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61010362512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97047211107).
61010362512 is an abundant number, since it is smaller than the sum of its proper divisors (133084059702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61010362512 is a wasteful number, since it uses less digits than its factorization.
61010362512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 389099 (or 389073 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 61010362512 its reverse (21526301016), we get a palindrome (82536663528).
The spelling of 61010362512 in words is "sixty-one billion, ten million, three hundred sixty-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •