Base | Representation |
---|---|
bin | 100001110111101101010… |
… | …0011110101010010010011 |
3 | 121111000200001210101022011 |
4 | 1003233122203311102103 |
5 | 1102232134300023310 |
6 | 13522310404123351 |
7 | 660215060412136 |
oct | 103573243652223 |
9 | 17430601711264 |
10 | 4655116407955 |
11 | 1535250943242 |
12 | 632239096557 |
13 | 279c8b4c1490 |
14 | 12144763821d |
15 | 8115496a78a |
hex | 43bda8f5493 |
4655116407955 has 8 divisors (see below), whose sum is σ = 6015842742672. Its totient is φ = 3437624424288.
The previous prime is 4655116407943. The next prime is 4655116407961. The reversal of 4655116407955 is 5597046115564.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4655116407955 - 213 = 4655116399763 is a prime.
It is a super-2 number, since 2×46551164079552 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4655116407955.
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 7 ways as a sum of consecutive naturals, for example, 35808587689 + ... + 35808587818.
It is an arithmetic number, because the mean of its divisors is an integer number (751980342834).
Almost surely, 24655116407955 is an apocalyptic number.
4655116407955 is a deficient number, since it is larger than the sum of its proper divisors (1360726334717).
4655116407955 is a wasteful number, since it uses less digits than its factorization.
4655116407955 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71617175525.
The product of its (nonzero) digits is 22680000, while the sum is 58.
The spelling of 4655116407955 in words is "four trillion, six hundred fifty-five billion, one hundred sixteen million, four hundred seven thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •