Base | Representation |
---|---|
bin | 1000101111101100110… |
… | …1001010011111001001 |
3 | 112100210201111112111000 |
4 | 2023323031022133021 |
5 | 4430144303420410 |
6 | 153004301525213 |
7 | 13566112666602 |
oct | 2137315123711 |
9 | 470721445430 |
10 | 150243420105 |
11 | 58799548299 |
12 | 25150273809 |
13 | 11224b29c1c |
14 | 73b3c36da9 |
15 | 3d95163dc0 |
hex | 22fb34a7c9 |
150243420105 has 32 divisors (see below), whose sum is σ = 267115432320. Its totient is φ = 80125018560.
The previous prime is 150243420077. The next prime is 150243420163. The reversal of 150243420105 is 501024342051.
150243420105 is a `hidden beast` number, since 1 + 502 + 4 + 34 + 20 + 105 = 666.
It is not a de Polignac number, because 150243420105 - 217 = 150243289033 is a prime.
It is a super-2 number, since 2×1502434201052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4369159 + ... + 4403411.
It is an arithmetic number, because the mean of its divisors is an integer number (8347357260).
Almost surely, 2150243420105 is an apocalyptic number.
150243420105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
150243420105 is a deficient number, since it is larger than the sum of its proper divisors (116872012215).
150243420105 is a wasteful number, since it uses less digits than its factorization.
150243420105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66758 (or 66752 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 150243420105 its reverse (501024342051), we get a palindrome (651267762156).
The spelling of 150243420105 in words is "one hundred fifty billion, two hundred forty-three million, four hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •