Base | Representation |
---|---|
bin | 1000110010100010100… |
… | …0000000000111100000 |
3 | 112102202211100122212121 |
4 | 2030220220000013200 |
5 | 4433224342231430 |
6 | 153212042234024 |
7 | 13624024656520 |
oct | 2145050000740 |
9 | 472684318777 |
10 | 151005430240 |
11 | 5904a6a0835 |
12 | 253234b5914 |
13 | 1131696b1b2 |
14 | 7447113680 |
15 | 3ddbed4a7a |
hex | 2328a001e0 |
151005430240 has 48 divisors (see below), whose sum is σ = 407714664672. Its totient is φ = 51773289984.
The previous prime is 151005430217. The next prime is 151005430249. The reversal of 151005430240 is 42034500151.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151005430249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67412019 + ... + 67414258.
It is an arithmetic number, because the mean of its divisors is an integer number (8494055514).
Almost surely, 2151005430240 is an apocalyptic number.
151005430240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
151005430240 is an abundant number, since it is smaller than the sum of its proper divisors (256709234432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151005430240 is a wasteful number, since it uses less digits than its factorization.
151005430240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134826299 (or 134826291 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 151005430240 its reverse (42034500151), we get a palindrome (193039930391).
The spelling of 151005430240 in words is "one hundred fifty-one billion, five million, four hundred thirty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •