Base | Representation |
---|---|
bin | 1101100000010100010… |
… | …10110100110000011001 |
3 | 1122100201211210220202101 |
4 | 12300022022310300121 |
5 | 30100311412441112 |
6 | 553100542403401 |
7 | 45345011036623 |
oct | 6601212646031 |
9 | 1570654726671 |
10 | 464027077657 |
11 | 16987a208510 |
12 | 75b21890561 |
13 | 349b04aaa00 |
14 | 1865d817c13 |
15 | c10c96e757 |
hex | 6c0a2b4c19 |
464027077657 has 48 divisors (see below), whose sum is σ = 561523700160. Its totient is φ = 379987046400.
The previous prime is 464027077637. The next prime is 464027077691. The reversal of 464027077657 is 756770720464.
It is a happy number.
It is not a de Polignac number, because 464027077657 - 211 = 464027075609 is a prime.
It is a super-2 number, since 2×4640270776572 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 464027077598 and 464027077607.
It is not an unprimeable number, because it can be changed into a prime (464027077607) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15010857 + ... + 15041737.
It is an arithmetic number, because the mean of its divisors is an integer number (11698410420).
Almost surely, 2464027077657 is an apocalyptic number.
It is an amenable number.
464027077657 is a deficient number, since it is larger than the sum of its proper divisors (97496622503).
464027077657 is a wasteful number, since it uses less digits than its factorization.
464027077657 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31114 (or 31101 counting only the distinct ones).
The product of its (nonzero) digits is 13829760, while the sum is 55.
The spelling of 464027077657 in words is "four hundred sixty-four billion, twenty-seven million, seventy-seven thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •