Base | Representation |
---|---|
bin | 1000110000000000011… |
… | …0010100110100011100 |
3 | 112101000102222022110010 |
4 | 2030000012110310130 |
5 | 4430331312413000 |
6 | 153020353243220 |
7 | 13601130532131 |
oct | 2140006246434 |
9 | 471012868403 |
10 | 150325513500 |
11 | 58830919278 |
12 | 25173863510 |
13 | 11238b410b6 |
14 | 73c0ac6588 |
15 | 3d9c47cd50 |
hex | 2300194d1c |
150325513500 has 48 divisors (see below), whose sum is σ = 437747899680. Its totient is φ = 40086803200.
The previous prime is 150325513469. The next prime is 150325513511. The reversal of 150325513500 is 5315523051.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50107005 + ... + 50110004.
It is an arithmetic number, because the mean of its divisors is an integer number (9119747910).
Almost surely, 2150325513500 is an apocalyptic number.
150325513500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150325513500 is an abundant number, since it is smaller than the sum of its proper divisors (287422386180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150325513500 is a wasteful number, since it uses less digits than its factorization.
150325513500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100217031 (or 100217019 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 30.
The spelling of 150325513500 in words is "one hundred fifty billion, three hundred twenty-five million, five hundred thirteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •