Base | Representation |
---|---|
bin | 11101110010001011… |
… | …11000100010011010 |
3 | 1112021101102210201010 |
4 | 32321011320202122 |
5 | 230221444313041 |
6 | 11202410034350 |
7 | 1104152463603 |
oct | 167105704232 |
9 | 45241383633 |
10 | 15990229146 |
11 | 6866081911 |
12 | 31231189b6 |
13 | 167aa44a68 |
14 | ab994adaa |
15 | 638c15a16 |
hex | 3b917889a |
15990229146 has 8 divisors (see below), whose sum is σ = 31980458304. Its totient is φ = 5330076380.
The previous prime is 15990229141. The next prime is 15990229153. The reversal of 15990229146 is 64192209951.
15990229146 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
15990229146 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 15990229095 and 15990229104.
It is not an unprimeable number, because it can be changed into a prime (15990229141) 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, 1332519090 + ... + 1332519101.
It is an arithmetic number, because the mean of its divisors is an integer number (3997557288).
Almost surely, 215990229146 is an apocalyptic number.
15990229146 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15990229146 is a wasteful number, since it uses less digits than its factorization.
15990229146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2665038196.
The product of its (nonzero) digits is 349920, while the sum is 48.
The spelling of 15990229146 in words is "fifteen billion, nine hundred ninety million, two hundred twenty-nine thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •