Base | Representation |
---|---|
bin | 110000011110011000000… |
… | …1111011111001000101011 |
3 | 212120220120101200120002111 |
4 | 1200330300033133020223 |
5 | 1333123344213022110 |
6 | 22100341532343151 |
7 | 1255223044404610 |
oct | 140746017371053 |
9 | 25526511616074 |
10 | 6662303642155 |
11 | 21395157a14a7 |
12 | 8b7248014ab7 |
13 | 394338a96345 |
14 | 190658862507 |
15 | b847d8e8e8a |
hex | 60f303df22b |
6662303642155 has 8 divisors (see below), whose sum is σ = 9136873566432. Its totient is φ = 4568436783168.
The previous prime is 6662303642153. The next prime is 6662303642201. The reversal of 6662303642155 is 5512463032666.
6662303642155 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 6662303642155 - 21 = 6662303642153 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6662303642099 and 6662303642108.
It is not an unprimeable number, because it can be changed into a prime (6662303642153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95175766282 + ... + 95175766351.
It is an arithmetic number, because the mean of its divisors is an integer number (1142109195804).
Almost surely, 26662303642155 is an apocalyptic number.
6662303642155 is a deficient number, since it is larger than the sum of its proper divisors (2474569924277).
6662303642155 is a wasteful number, since it uses less digits than its factorization.
6662303642155 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190351532645.
The product of its (nonzero) digits is 4665600, while the sum is 49.
The spelling of 6662303642155 in words is "six trillion, six hundred sixty-two billion, three hundred three million, six hundred forty-two thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •