Base | Representation |
---|---|
bin | 101001110101100110… |
… | …100110101000110001 |
3 | 11021221202000222101021 |
4 | 221311212212220301 |
5 | 1214000204230321 |
6 | 32345345535441 |
7 | 3150140610310 |
oct | 516546465061 |
9 | 137852028337 |
10 | 44922726961 |
11 | 18062787732 |
12 | 8858644581 |
13 | 430bbc7058 |
14 | 22622b6277 |
15 | 127dc77941 |
hex | a759a6a31 |
44922726961 has 8 divisors (see below), whose sum is σ = 51343055744. Its totient is φ = 38503097280.
The previous prime is 44922726929. The next prime is 44922727013. The reversal of 44922726961 is 16962722944.
44922726961 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 44922726961 - 25 = 44922726929 is a prime.
It is a super-2 number, since 2×449227269612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 44922726899 and 44922726908.
It is not an unprimeable number, because it can be changed into a prime (44922726911) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28965 + ... + 301138.
It is an arithmetic number, because the mean of its divisors is an integer number (6417881968).
Almost surely, 244922726961 is an apocalyptic number.
It is an amenable number.
44922726961 is a deficient number, since it is larger than the sum of its proper divisors (6420328783).
44922726961 is a wasteful number, since it uses less digits than its factorization.
44922726961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349551.
The product of its digits is 2612736, while the sum is 52.
The spelling of 44922726961 in words is "forty-four billion, nine hundred twenty-two million, seven hundred twenty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •