Base | Representation |
---|---|
bin | 10100011100000110101010… |
… | …01100110110010101011110 |
3 | 12220010210210000100022100110 |
4 | 22032003111030312111132 |
5 | 21342344120330410023 |
6 | 235331543211510450 |
7 | 12316151423236554 |
oct | 1216032514662536 |
9 | 186123700308313 |
10 | 44946114700638 |
11 | 133595a4007678 |
12 | 505aa36a58426 |
13 | 1c1052898a3b8 |
14 | b15591517bd4 |
15 | 52e24192da93 |
hex | 28e0d533655e |
44946114700638 has 16 divisors (see below), whose sum is σ = 92321749115280. Its totient is φ = 14577118281216.
The previous prime is 44946114700589. The next prime is 44946114700639. The reversal of 44946114700638 is 83600741164944.
44946114700638 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44946114700639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 101229987843 + ... + 101229988286.
It is an arithmetic number, because the mean of its divisors is an integer number (5770109319705).
Almost surely, 244946114700638 is an apocalyptic number.
44946114700638 is an abundant number, since it is smaller than the sum of its proper divisors (47375634414642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
44946114700638 is a wasteful number, since it uses less digits than its factorization.
44946114700638 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202459976171.
The product of its (nonzero) digits is 13934592, while the sum is 57.
The spelling of 44946114700638 in words is "forty-four trillion, nine hundred forty-six billion, one hundred fourteen million, seven hundred thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •