Base | Representation |
---|---|
bin | 1000110011100001110… |
… | …1101010011011001001 |
3 | 112110110100100220021020 |
4 | 2030320131222123021 |
5 | 4434300403433101 |
6 | 153254253503053 |
7 | 13633432414452 |
oct | 2147035523311 |
9 | 473410326236 |
10 | 151271155401 |
11 | 59176695003 |
12 | 253984a1a89 |
13 | 11359a28312 |
14 | 7470524129 |
15 | 3e054c3136 |
hex | 233876a6c9 |
151271155401 has 4 divisors (see below), whose sum is σ = 201694873872. Its totient is φ = 100847436932.
The previous prime is 151271155351. The next prime is 151271155423. The reversal of 151271155401 is 104551172151.
151271155401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 151271155401 - 26 = 151271155337 is a prime.
It is not an unprimeable number, because it can be changed into a prime (151271159401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25211859231 + ... + 25211859236.
It is an arithmetic number, because the mean of its divisors is an integer number (50423718468).
Almost surely, 2151271155401 is an apocalyptic number.
It is an amenable number.
151271155401 is a deficient number, since it is larger than the sum of its proper divisors (50423718471).
151271155401 is an equidigital number, since it uses as much as digits as its factorization.
151271155401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50423718470.
The product of its (nonzero) digits is 7000, while the sum is 33.
The spelling of 151271155401 in words is "one hundred fifty-one billion, two hundred seventy-one million, one hundred fifty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •