Base | Representation |
---|---|
bin | 1000110010100100011… |
… | …1000011000101111001 |
3 | 112102210101200011000001 |
4 | 2030221013003011321 |
5 | 4433233433201024 |
6 | 153212532513001 |
7 | 13624154104411 |
oct | 2145107030571 |
9 | 472711604001 |
10 | 151013568889 |
11 | 5905424a497 |
12 | 2532617b761 |
13 | 1131855a771 |
14 | 7448231641 |
15 | 3ddca91244 |
hex | 23291c3179 |
151013568889 has 4 divisors (see below), whose sum is σ = 157579376256. Its totient is φ = 144447761524.
The previous prime is 151013568883. The next prime is 151013568907. The reversal of 151013568889 is 988865310151.
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, and also an emirpimes, since its reverse is a distinct semiprime: 988865310151 = 521 ⋅1898014031.
It is a cyclic number.
It is not a de Polignac number, because 151013568889 - 211 = 151013566841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151013568883) 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, 3282903649 + ... + 3282903694.
It is an arithmetic number, because the mean of its divisors is an integer number (39394844064).
Almost surely, 2151013568889 is an apocalyptic number.
It is an amenable number.
151013568889 is a deficient number, since it is larger than the sum of its proper divisors (6565807367).
151013568889 is an equidigital number, since it uses as much as digits as its factorization.
151013568889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6565807366.
The product of its (nonzero) digits is 2073600, while the sum is 55.
The spelling of 151013568889 in words is "one hundred fifty-one billion, thirteen million, five hundred sixty-eight thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •