Base | Representation |
---|---|
bin | 1000110001101111111… |
… | …1000000011011001010 |
3 | 112102020001022020002020 |
4 | 2030123333000123022 |
5 | 4432311044411002 |
6 | 153135024545310 |
7 | 13615541246301 |
oct | 2143377003312 |
9 | 472201266066 |
10 | 150793357002 |
11 | 58a50a11aa2 |
12 | 25284482236 |
13 | 112b1a47782 |
14 | 7426cab438 |
15 | 3dc85932bc |
hex | 231bfc06ca |
150793357002 has 8 divisors (see below), whose sum is σ = 301586714016. Its totient is φ = 50264452332.
The previous prime is 150793356983. The next prime is 150793357019. The reversal of 150793357002 is 200753397051.
150793357002 is digitally balanced in base 2, 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.
150793357002 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12566113078 + ... + 12566113089.
It is an arithmetic number, because the mean of its divisors is an integer number (37698339252).
Almost surely, 2150793357002 is an apocalyptic number.
150793357002 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.
150793357002 is a wasteful number, since it uses less digits than its factorization.
150793357002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25132226172.
The product of its (nonzero) digits is 198450, while the sum is 42.
The spelling of 150793357002 in words is "one hundred fifty billion, seven hundred ninety-three million, three hundred fifty-seven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •