Base | Representation |
---|---|
bin | 100110110100100100001… |
… | …0100010001011001100111 |
3 | 200220002000112110020010002 |
4 | 1031221020110101121213 |
5 | 1144404213014432320 |
6 | 15203042412451515 |
7 | 1060324134161423 |
oct | 115511024213147 |
9 | 20802015406102 |
10 | 5335562655335 |
11 | 1777888026100 |
12 | 722099179b9b |
13 | 2c91ab8683a3 |
14 | 146357a19b83 |
15 | 93bcc053675 |
hex | 4da48511667 |
5335562655335 has 48 divisors (see below), whose sum is σ = 7057444584960. Its totient is φ = 3869505393600.
The previous prime is 5335562655329. The next prime is 5335562655343.
It is a happy number.
5335562655335 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5335562655335 - 212 = 5335562651239 is a prime.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 643532540 + ... + 643540830.
It is an arithmetic number, because the mean of its divisors is an integer number (147030095520).
Almost surely, 25335562655335 is an apocalyptic number.
5335562655335 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5335562655335 is a deficient number, since it is larger than the sum of its proper divisors (1721881929625).
5335562655335 is a wasteful number, since it uses less digits than its factorization.
5335562655335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11180 (or 11169 counting only the distinct ones).
The product of its digits is 91125000, while the sum is 56.
The spelling of 5335562655335 in words is "five trillion, three hundred thirty-five billion, five hundred sixty-two million, six hundred fifty-five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •