Base | Representation |
---|---|
bin | 111001000011110011… |
… | …010100110001011110 |
3 | 12212010210210122002110 |
4 | 321003303110301132 |
5 | 2000433332220141 |
6 | 44051245534450 |
7 | 4266153334320 |
oct | 710363246136 |
9 | 185123718073 |
10 | 61267070046 |
11 | 23a8a733596 |
12 | ba5a274426 |
13 | 5a15105690 |
14 | 2d72c81610 |
15 | 18d8adae16 |
hex | e43cd4c5e |
61267070046 has 128 divisors (see below), whose sum is σ = 163040209920. Its totient is φ = 14894088192.
The previous prime is 61267069991. The next prime is 61267070089. The reversal of 61267070046 is 64007076216.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 61267069986 and 61267070013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 304030 + ... + 463646.
It is an arithmetic number, because the mean of its divisors is an integer number (1273751640).
Almost surely, 261267070046 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61267070046, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81520104960).
61267070046 is an abundant number, since it is smaller than the sum of its proper divisors (101773139874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61267070046 is a wasteful number, since it uses less digits than its factorization.
61267070046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159698.
The product of its (nonzero) digits is 84672, while the sum is 39.
The spelling of 61267070046 in words is "sixty-one billion, two hundred sixty-seven million, seventy thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •