Base | Representation |
---|---|
bin | 1000101101011000001… |
… | …0000010100000110101 |
3 | 112022012020221122122021 |
4 | 2023112002002200311 |
5 | 4422410123344434 |
6 | 152422342233141 |
7 | 13544500602355 |
oct | 2132602024065 |
9 | 468166848567 |
10 | 149619746869 |
11 | 584a94a036a |
12 | 24bb74257b1 |
13 | 11155862cc8 |
14 | 735508ab65 |
15 | 3d5a51bcb4 |
hex | 22d6082835 |
149619746869 has 2 divisors, whose sum is σ = 149619746870. Its totient is φ = 149619746868.
The previous prime is 149619746821. The next prime is 149619746953. The reversal of 149619746869 is 968647916941.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112875840900 + 36743905969 = 335970^2 + 191687^2 .
It is an emirp because it is prime and its reverse (968647916941) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-149619746869 is a prime.
It is a super-2 number, since 2×1496197468692 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 149619746798 and 149619746807.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (149619743869) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74809873434 + 74809873435.
It is an arithmetic number, because the mean of its divisors is an integer number (74809873435).
Almost surely, 2149619746869 is an apocalyptic number.
It is an amenable number.
149619746869 is a deficient number, since it is larger than the sum of its proper divisors (1).
149619746869 is an equidigital number, since it uses as much as digits as its factorization.
149619746869 is an evil number, because the sum of its binary digits is even.
The product of its digits is 141087744, while the sum is 70.
The spelling of 149619746869 in words is "one hundred forty-nine billion, six hundred nineteen million, seven hundred forty-six thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •