Base | Representation |
---|---|
bin | 1000110010010100011… |
… | …0100101100110101010 |
3 | 112102121201011112021010 |
4 | 2030211012211212222 |
5 | 4433114230323432 |
6 | 153202131524350 |
7 | 13622406466536 |
oct | 2144506454652 |
9 | 472551145233 |
10 | 150946339242 |
11 | 5901a3008a6 |
12 | 253077596b6 |
13 | 1130764bbca |
14 | 743d330bc6 |
15 | 3dd6c113cc |
hex | 23251a59aa |
150946339242 has 16 divisors (see below), whose sum is σ = 319651071552. Its totient is φ = 47355714240.
The previous prime is 150946339241. The next prime is 150946339253. The reversal of 150946339242 is 242933649051.
It is a junction number, because it is equal to n+sod(n) for n = 150946339191 and 150946339200.
It is not an unprimeable number, because it can be changed into a prime (150946339241) 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 7 ways as a sum of consecutive naturals, for example, 739932934 + ... + 739933137.
It is an arithmetic number, because the mean of its divisors is an integer number (19978191972).
Almost surely, 2150946339242 is an apocalyptic number.
150946339242 is an abundant number, since it is smaller than the sum of its proper divisors (168704732310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150946339242 is a wasteful number, since it uses less digits than its factorization.
150946339242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1479866093.
The product of its (nonzero) digits is 1399680, while the sum is 48.
The spelling of 150946339242 in words is "one hundred fifty billion, nine hundred forty-six million, three hundred thirty-nine thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •