Base | Representation |
---|---|
bin | 1000101100110100000… |
… | …0111011110100100001 |
3 | 112021210201021121022122 |
4 | 2023031000323310201 |
5 | 4422102411243434 |
6 | 152355335514025 |
7 | 13540652652602 |
oct | 2131500736441 |
9 | 467721247278 |
10 | 149468462369 |
11 | 58431061056 |
12 | 24b74828915 |
13 | 11130404555 |
14 | 733cd49da9 |
15 | 3d4c0d6c2e |
hex | 22cd03bd21 |
149468462369 has 4 divisors (see below), whose sum is σ = 149470398144. Its totient is φ = 149466526596.
The previous prime is 149468462329. The next prime is 149468462447. The reversal of 149468462369 is 963264864941.
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 not a de Polignac number, because 149468462369 - 28 = 149468462113 is a prime.
It is a super-2 number, since 2×1494684623692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (149468462329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 847037 + ... + 1008170.
It is an arithmetic number, because the mean of its divisors is an integer number (37367599536).
Almost surely, 2149468462369 is an apocalyptic number.
It is an amenable number.
149468462369 is a deficient number, since it is larger than the sum of its proper divisors (1935775).
149468462369 is an equidigital number, since it uses as much as digits as its factorization.
149468462369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1935774.
The product of its digits is 53747712, while the sum is 62.
The spelling of 149468462369 in words is "one hundred forty-nine billion, four hundred sixty-eight million, four hundred sixty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •