Base | Representation |
---|---|
bin | 1000110000101011011… |
… | …1100110100100110000 |
3 | 112101111000222022110010 |
4 | 2030022313212210300 |
5 | 4431214042002230 |
6 | 153050330134520 |
7 | 13605453423015 |
oct | 2141267464460 |
9 | 471430868403 |
10 | 150506203440 |
11 | 589139122aa |
12 | 25204281440 |
13 | 112673c7018 |
14 | 73daabd70c |
15 | 3dad2709b0 |
hex | 230ade6930 |
150506203440 has 80 divisors (see below), whose sum is σ = 466609394016. Its totient is φ = 40131532800.
The previous prime is 150506203439. The next prime is 150506203453. The reversal of 150506203440 is 44302605051.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 150506203398 and 150506203407.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4042510 + ... + 4079570.
Almost surely, 2150506203440 is an apocalyptic number.
150506203440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150506203440 is an abundant number, since it is smaller than the sum of its proper divisors (316103190576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150506203440 is a wasteful number, since it uses less digits than its factorization.
150506203440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53998 (or 53992 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 150506203440 its reverse (44302605051), we get a palindrome (194808808491).
The spelling of 150506203440 in words is "one hundred fifty billion, five hundred six million, two hundred three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •