Base | Representation |
---|---|
bin | 11011101000110010101… |
… | …100001101101101111101 |
3 | 20201120020022210001001101 |
4 | 123220302230031231331 |
5 | 222104103323334112 |
6 | 4012254204213101 |
7 | 254133406414420 |
oct | 33506254155575 |
9 | 6646208701041 |
10 | 1899225996157 |
11 | 672503620196 |
12 | 2680bab3a191 |
13 | 10a1335a44b9 |
14 | 67cccb0d9b7 |
15 | 3460ad53757 |
hex | 1ba32b0db7d |
1899225996157 has 4 divisors (see below), whose sum is σ = 2170543995616. Its totient is φ = 1627907996700.
The previous prime is 1899225996133. The next prime is 1899225996167. The reversal of 1899225996157 is 7516995229981.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1899225996157 is a prime.
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 1899225996157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1899225996167) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135658999719 + ... + 135658999732.
It is an arithmetic number, because the mean of its divisors is an integer number (542635998904).
Almost surely, 21899225996157 is an apocalyptic number.
It is an amenable number.
1899225996157 is a deficient number, since it is larger than the sum of its proper divisors (271317999459).
1899225996157 is an equidigital number, since it uses as much as digits as its factorization.
1899225996157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271317999458.
The product of its digits is 220449600, while the sum is 73.
The spelling of 1899225996157 in words is "one trillion, eight hundred ninety-nine billion, two hundred twenty-five million, nine hundred ninety-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •