Base | Representation |
---|---|
bin | 100001110111101101100… |
… | …0001001011101110100101 |
3 | 121111000200121021021121202 |
4 | 1003233123001023232211 |
5 | 1102232143232231203 |
6 | 13522311241052245 |
7 | 660215212665665 |
oct | 103573301135645 |
9 | 17430617237552 |
10 | 4655124102053 |
11 | 15352552189a7 |
12 | 63223b787085 |
13 | 279c8cc865b9 |
14 | 12144867c1a5 |
15 | 8115548a388 |
hex | 43bdb04bba5 |
4655124102053 has 8 divisors (see below), whose sum is σ = 4900477142400. Its totient is φ = 4409805712608.
The previous prime is 4655124102049. The next prime is 4655124102113. The reversal of 4655124102053 is 3502014215564.
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 4655124102053 - 22 = 4655124102049 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4655124101998 and 4655124102016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4655124102023) by changing a digit.
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, 8386733 + ... + 8924546.
It is an arithmetic number, because the mean of its divisors is an integer number (612559642800).
Almost surely, 24655124102053 is an apocalyptic number.
It is an amenable number.
4655124102053 is a deficient number, since it is larger than the sum of its proper divisors (245353040347).
4655124102053 is a wasteful number, since it uses less digits than its factorization.
4655124102053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17325451.
The product of its (nonzero) digits is 144000, while the sum is 38.
The spelling of 4655124102053 in words is "four trillion, six hundred fifty-five billion, one hundred twenty-four million, one hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •