Base | Representation |
---|---|
bin | 101111101101010101… |
… | …011011011001000110 |
3 | 11220020001121200021000 |
4 | 233231111123121012 |
5 | 1314402433121140 |
6 | 35311052434130 |
7 | 3462303464043 |
oct | 575525333106 |
9 | 156201550230 |
10 | 51226457670 |
11 | 1a7a7aaa933 |
12 | 9b17778946 |
13 | 4aa4b98a1b |
14 | 269d58a1ca |
15 | 14ec3a9a30 |
hex | bed55b646 |
51226457670 has 128 divisors (see below), whose sum is σ = 142649164800. Its totient is φ = 13056747264.
The previous prime is 51226457651. The next prime is 51226457683. The reversal of 51226457670 is 7675462215.
51226457670 is a `hidden beast` number, since 5 + 1 + 2 + 2 + 6 + 4 + 576 + 70 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12374461 + ... + 12378599.
It is an arithmetic number, because the mean of its divisors is an integer number (1114446600).
Almost surely, 251226457670 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51226457670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71324582400).
51226457670 is an abundant number, since it is smaller than the sum of its proper divisors (91422707130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51226457670 is a wasteful number, since it uses less digits than its factorization.
51226457670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6171 (or 6165 counting only the distinct ones).
The product of its (nonzero) digits is 705600, while the sum is 45.
It can be divided in two parts, 5122645 and 7670, that added together give a palindrome (5130315).
The spelling of 51226457670 in words is "fifty-one billion, two hundred twenty-six million, four hundred fifty-seven thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •