Base | Representation |
---|---|
bin | 1000111001111110000… |
… | …1110111110011001101 |
3 | 112121220212002011012201 |
4 | 2032133201313303031 |
5 | 10001321034441023 |
6 | 154142023401501 |
7 | 14024330123413 |
oct | 2163741676315 |
9 | 477825064181 |
10 | 153000312013 |
11 | 59983761a5a |
12 | 2579b5b3291 |
13 | 11574042a03 |
14 | 75960392b3 |
15 | 3ea71d5bad |
hex | 239f877ccd |
153000312013 has 8 divisors (see below), whose sum is σ = 156921722496. Its totient is φ = 149095413600.
The previous prime is 153000311969. The next prime is 153000312037. The reversal of 153000312013 is 310213000351.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-153000312013 is a prime.
It is a super-2 number, since 2×1530003120132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153000318013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4109248 + ... + 4146313.
It is an arithmetic number, because the mean of its divisors is an integer number (19615215312).
Almost surely, 2153000312013 is an apocalyptic number.
It is an amenable number.
153000312013 is a deficient number, since it is larger than the sum of its proper divisors (3921410483).
153000312013 is an equidigital number, since it uses as much as digits as its factorization.
153000312013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8256035.
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 153000312013 its reverse (310213000351), we get a palindrome (463213312364).
The spelling of 153000312013 in words is "one hundred fifty-three billion, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •