Base | Representation |
---|---|
bin | 10101001010111100010010… |
… | …11000101000000101001100 |
3 | 20002211122202201220022012212 |
4 | 22211132021120220011030 |
5 | 22100231033044034224 |
6 | 243003140405245552 |
7 | 12543343405035356 |
oct | 1245361130500514 |
9 | 202748681808185 |
10 | 46555455455564 |
11 | 1391a06a9a7530 |
12 | 527a913a038b8 |
13 | 1cc9211b30853 |
14 | b6d42059c0d6 |
15 | 55b03309dd0e |
hex | 2a578962814c |
46555455455564 has 96 divisors (see below), whose sum is σ = 90672341760000. Its totient is φ = 20736834693120.
The previous prime is 46555455455507. The next prime is 46555455455567.
46555455455564 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 46555455455494 and 46555455455503.
It is not an unprimeable number, because it can be changed into a prime (46555455455567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1776302492 + ... + 1776328700.
It is an arithmetic number, because the mean of its divisors is an integer number (944503560000).
Almost surely, 246555455455564 is an apocalyptic number.
46555455455564 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
46555455455564 is a deficient number, since it is larger than the sum of its proper divisors (44116886304436).
46555455455564 is a wasteful number, since it uses less digits than its factorization.
46555455455564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28431 (or 28429 counting only the distinct ones).
The product of its digits is 3600000000, while the sum is 68.
The spelling of 46555455455564 in words is "forty-six trillion, five hundred fifty-five billion, four hundred fifty-five million, four hundred fifty-five thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •