Base | Representation |
---|---|
bin | 1000110011110000101… |
… | …1100110100110100111 |
3 | 112110121200201212011102 |
4 | 2030330023212212213 |
5 | 4434412340430043 |
6 | 153304402430315 |
7 | 13635120531614 |
oct | 2147413464647 |
9 | 473550655142 |
10 | 151333530023 |
11 | 591a8917a85 |
12 | 253b536239b |
13 | 11369927090 |
14 | 747891d50b |
15 | 3e0abe46b8 |
hex | 233c2e69a7 |
151333530023 has 8 divisors (see below), whose sum is σ = 168594384000. Its totient is φ = 134875506528.
The previous prime is 151333529983. The next prime is 151333530037. The reversal of 151333530023 is 320035333151.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151333530023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151333530043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200707223 + ... + 200707976.
It is an arithmetic number, because the mean of its divisors is an integer number (21074298000).
Almost surely, 2151333530023 is an apocalyptic number.
151333530023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
151333530023 is a deficient number, since it is larger than the sum of its proper divisors (17260853977).
151333530023 is a wasteful number, since it uses less digits than its factorization.
151333530023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401415241.
The product of its (nonzero) digits is 12150, while the sum is 29.
Adding to 151333530023 its reverse (320035333151), we get a palindrome (471368863174).
The spelling of 151333530023 in words is "one hundred fifty-one billion, three hundred thirty-three million, five hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •