Base | Representation |
---|---|
bin | 100000000000110101011… |
… | …101101011011111111111 |
3 | 21210022101020000201022222 |
4 | 200000311131223133333 |
5 | 242020414034301401 |
6 | 4402343541155555 |
7 | 314640034256456 |
oct | 40006535533777 |
9 | 7708336021288 |
10 | 2199920228351 |
11 | 778a876873aa |
12 | 2b64389bbbbb |
13 | 12c5b41a3091 |
14 | 78696127b9d |
15 | 3c359445c1b |
hex | 2003576b7ff |
2199920228351 has 8 divisors (see below), whose sum is σ = 2299241194320. Its totient is φ = 2102163372288.
The previous prime is 2199920228333. The next prime is 2199920228377. The reversal of 2199920228351 is 1538220299912.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2199920228351 is a prime.
It is a super-2 number, since 2×21999202283512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2199920228293 and 2199920228302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2199920228321) 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, 391024601 + ... + 391030226.
It is an arithmetic number, because the mean of its divisors is an integer number (287405149290).
Almost surely, 22199920228351 is an apocalyptic number.
2199920228351 is a deficient number, since it is larger than the sum of its proper divisors (99320965969).
2199920228351 is an equidigital number, since it uses as much as digits as its factorization.
2199920228351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 782054953.
The product of its (nonzero) digits is 1399680, while the sum is 53.
The spelling of 2199920228351 in words is "two trillion, one hundred ninety-nine billion, nine hundred twenty million, two hundred twenty-eight thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •