Base | Representation |
---|---|
bin | 1000110010001010111… |
… | …0011111100101101001 |
3 | 112102111221010220011212 |
4 | 2030202232133211221 |
5 | 4433024023444323 |
6 | 153154145202505 |
7 | 13621413551120 |
oct | 2144256374551 |
9 | 472457126155 |
10 | 150906468713 |
11 | 58aa9849550 |
12 | 252b6330435 |
13 | 112cc2cc290 |
14 | 7437d12ab7 |
15 | 3dd3487b78 |
hex | 2322b9f969 |
150906468713 has 32 divisors (see below), whose sum is σ = 202668840192. Its totient is φ = 108515635200.
The previous prime is 150906468701. The next prime is 150906468749. The reversal of 150906468713 is 317864609051.
It is not a de Polignac number, because 150906468713 - 28 = 150906468457 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (150906468793) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4259633 + ... + 4294913.
It is an arithmetic number, because the mean of its divisors is an integer number (6333401256).
Almost surely, 2150906468713 is an apocalyptic number.
150906468713 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
150906468713 is a deficient number, since it is larger than the sum of its proper divisors (51762371479).
150906468713 is a wasteful number, since it uses less digits than its factorization.
150906468713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39585.
The product of its (nonzero) digits is 1088640, while the sum is 50.
The spelling of 150906468713 in words is "one hundred fifty billion, nine hundred six million, four hundred sixty-eight thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •