Base | Representation |
---|---|
bin | 1000110000111111110… |
… | …0110111011011000110 |
3 | 112101200222102021011020 |
4 | 2030033330313123012 |
5 | 4431402404004004 |
6 | 153103013452010 |
7 | 13610540240262 |
oct | 2141774673306 |
9 | 471628367136 |
10 | 150591469254 |
11 | 58957a5a816 |
12 | 25228941006 |
13 | 1127bc7c175 |
14 | 74081570a2 |
15 | 3db59b48d9 |
hex | 230ff376c6 |
150591469254 has 8 divisors (see below), whose sum is σ = 301182938520. Its totient is φ = 50197156416.
The previous prime is 150591469243. The next prime is 150591469267. The reversal of 150591469254 is 452964195051.
150591469254 is digitally balanced in base 3, 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.
150591469254 is an admirable number.
It is a super-2 number, since 2×1505914692542 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150591469197 and 150591469206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12549289099 + ... + 12549289110.
It is an arithmetic number, because the mean of its divisors is an integer number (37647867315).
Almost surely, 2150591469254 is an apocalyptic number.
150591469254 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.
150591469254 is a wasteful number, since it uses less digits than its factorization.
150591469254 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25098578214.
The product of its (nonzero) digits is 1944000, while the sum is 51.
The spelling of 150591469254 in words is "one hundred fifty billion, five hundred ninety-one million, four hundred sixty-nine thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •