Base | Representation |
---|---|
bin | 11011111000110111010100… |
… | …00111110000110100100100 |
3 | 22001010211220220012010011020 |
4 | 31330123222013300310210 |
5 | 31014242130031041222 |
6 | 334233241244011140 |
7 | 15626522621042235 |
oct | 1574335207606444 |
9 | 261124826163136 |
10 | 61327470955812 |
11 | 185a491a606a66 |
12 | 6a65811b30ab0 |
13 | 282b2040ac669 |
14 | 11203a04b908c |
15 | 71540558a65c |
hex | 37c6ea1f0d24 |
61327470955812 has 48 divisors (see below), whose sum is σ = 149072149396800. Its totient is φ = 19605860899840.
The previous prime is 61327470955799. The next prime is 61327470955813. The reversal of 61327470955812 is 21855907472316.
It is a super-2 number, since 2×613274709558122 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (61327470955813) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1056321237 + ... + 1056379292.
It is an arithmetic number, because the mean of its divisors is an integer number (3105669779100).
It is a 1-persistent number, because it is pandigital, but 2⋅61327470955812 = 122654941911624 is not.
Almost surely, 261327470955812 is an apocalyptic number.
It is an amenable number.
61327470955812 is an abundant number, since it is smaller than the sum of its proper divisors (87744678440988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61327470955812 is a wasteful number, since it uses less digits than its factorization.
61327470955812 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2112700636 (or 2112700634 counting only the distinct ones).
The product of its (nonzero) digits is 25401600, while the sum is 60.
The spelling of 61327470955812 in words is "sixty-one trillion, three hundred twenty-seven billion, four hundred seventy million, nine hundred fifty-five thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •