Base | Representation |
---|---|
bin | 11011101001101010011… |
… | …101100100010001010011 |
3 | 20201122122112102201121211 |
4 | 123221222131210101103 |
5 | 222113012342233332 |
6 | 4012531111200551 |
7 | 254165530535131 |
oct | 33515235442123 |
9 | 6648575381554 |
10 | 1900161680467 |
11 | 672943805706 |
12 | 268320376157 |
13 | 10a2523b325b |
14 | 67d7b0b8751 |
15 | 3466307d447 |
hex | 1ba6a764453 |
1900161680467 has 2 divisors, whose sum is σ = 1900161680468. Its totient is φ = 1900161680466.
The previous prime is 1900161680437. The next prime is 1900161680471. The reversal of 1900161680467 is 7640861610091.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1900161680467 - 211 = 1900161678419 is a prime.
It is a super-2 number, since 2×19001616804672 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1900161680467.
It is not a weakly prime, because it can be changed into another prime (1900161680407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 950080840233 + 950080840234.
It is an arithmetic number, because the mean of its divisors is an integer number (950080840234).
Almost surely, 21900161680467 is an apocalyptic number.
1900161680467 is a deficient number, since it is larger than the sum of its proper divisors (1).
1900161680467 is an equidigital number, since it uses as much as digits as its factorization.
1900161680467 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 435456, while the sum is 49.
The spelling of 1900161680467 in words is "one trillion, nine hundred billion, one hundred sixty-one million, six hundred eighty thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •