Base | Representation |
---|---|
bin | 10101001110000001110010… |
… | …11100010001011110011000 |
3 | 20010012210110100121211021021 |
4 | 22213000321130101132120 |
5 | 22104000212013313124 |
6 | 243123554123452224 |
7 | 12554116116242632 |
oct | 1247007134213630 |
9 | 203183410554237 |
10 | 46661488416664 |
11 | 139600318265a0 |
12 | 5297386087074 |
13 | 200620c4a9a54 |
14 | b745dc96ba52 |
15 | 55db8bc827e4 |
hex | 2a7039711798 |
46661488416664 has 64 divisors (see below), whose sum is σ = 95512718937600. Its totient is φ = 21194491718400.
The previous prime is 46661488416659. The next prime is 46661488416667.
46661488416664 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 46661488416593 and 46661488416602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46661488416667) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 751712749 + ... + 751774819.
It is an arithmetic number, because the mean of its divisors is an integer number (1492386233400).
Almost surely, 246661488416664 is an apocalyptic number.
46661488416664 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
46661488416664 is an abundant number, since it is smaller than the sum of its proper divisors (48851230520936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46661488416664 is a wasteful number, since it uses less digits than its factorization.
46661488416664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68104 (or 68100 counting only the distinct ones).
The product of its digits is 764411904, while the sum is 70.
The spelling of 46661488416664 in words is "forty-six trillion, six hundred sixty-one billion, four hundred eighty-eight million, four hundred sixteen thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •