Base | Representation |
---|---|
bin | 10101000001110000110010… |
… | …11010111100110100011110 |
3 | 20001201111122012100202001010 |
4 | 22200320121122330310132 |
5 | 22030044102331411443 |
6 | 242202214432000050 |
7 | 12511506256242354 |
oct | 1240703132746436 |
9 | 201644565322033 |
10 | 46240044403998 |
11 | 13808324655085 |
12 | 5229769390026 |
13 | 1ca5557275223 |
14 | b5c05c7d57d4 |
15 | 552c22982733 |
hex | 2a0e196bcd1e |
46240044403998 has 8 divisors (see below), whose sum is σ = 92480088808008. Its totient is φ = 15413348134664.
The previous prime is 46240044403873. The next prime is 46240044404033. The reversal of 46240044403998 is 89930444004264.
46240044403998 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.
46240044403998 is an admirable number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 3853337033661 + ... + 3853337033672.
It is an arithmetic number, because the mean of its divisors is an integer number (11560011101001).
Almost surely, 246240044403998 is an apocalyptic number.
46240044403998 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46240044403998 is a wasteful number, since it uses less digits than its factorization.
46240044403998 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7706674067338.
The product of its (nonzero) digits is 23887872, while the sum is 57.
The spelling of 46240044403998 in words is "forty-six trillion, two hundred forty billion, forty-four million, four hundred three thousand, nine hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •