Base | Representation |
---|---|
bin | 1000110010111101110… |
… | …1001110000010101001 |
3 | 112110001211000122200010 |
4 | 2030233131032002221 |
5 | 4433443212403301 |
6 | 153231255002133 |
7 | 13626616116150 |
oct | 2145735160251 |
9 | 473054018603 |
10 | 151120044201 |
11 | 590a9363a15 |
12 | 25355969349 |
13 | 1133462a6c9 |
14 | 745842a597 |
15 | 3de70c45d6 |
hex | 232f74e0a9 |
151120044201 has 16 divisors (see below), whose sum is σ = 230370243584. Its totient is φ = 86319780624.
The previous prime is 151120044167. The next prime is 151120044269. The reversal of 151120044201 is 102440021151.
151120044201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 151120044201 - 27 = 151120044073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151120044301) 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 15 ways as a sum of consecutive naturals, for example, 1384951 + ... + 1490076.
It is an arithmetic number, because the mean of its divisors is an integer number (14398140224).
Almost surely, 2151120044201 is an apocalyptic number.
It is an amenable number.
151120044201 is a deficient number, since it is larger than the sum of its proper divisors (79250199383).
151120044201 is a wasteful number, since it uses less digits than its factorization.
151120044201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2877540.
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 151120044201 its reverse (102440021151), we get a palindrome (253560065352).
The spelling of 151120044201 in words is "one hundred fifty-one billion, one hundred twenty million, forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •