Base | Representation |
---|---|
bin | 1000110011100001100… |
… | …0000111010101111110 |
3 | 112110110020122000012011 |
4 | 2030320120013111332 |
5 | 4434300020412430 |
6 | 153254202401434 |
7 | 13633414146262 |
oct | 2147030072576 |
9 | 473406560164 |
10 | 151269700990 |
11 | 59175891311 |
12 | 25397b0027a |
13 | 11359639315 |
14 | 74702660a2 |
15 | 3e052d722a |
hex | 233860757e |
151269700990 has 32 divisors (see below), whose sum is σ = 286801391520. Its totient is φ = 57286232064.
The previous prime is 151269700987. The next prime is 151269700993. The reversal of 151269700990 is 99007962151.
151269700990 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (151269700987) and next prime (151269700993).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151269700993) 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, 38742 + ... + 551398.
It is an arithmetic number, because the mean of its divisors is an integer number (8962543485).
Almost surely, 2151269700990 is an apocalyptic number.
151269700990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
151269700990 is a deficient number, since it is larger than the sum of its proper divisors (135531690530).
151269700990 is a wasteful number, since it uses less digits than its factorization.
151269700990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514236.
The product of its (nonzero) digits is 306180, while the sum is 49.
The spelling of 151269700990 in words is "one hundred fifty-one billion, two hundred sixty-nine million, seven hundred thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •