Base | Representation |
---|---|
bin | 11101110001110001000… |
… | …10010010101110101001 |
3 | 10121210221010121100222011 |
4 | 32320320202102232221 |
5 | 113230403041331103 |
6 | 2102010130555521 |
7 | 133630425466066 |
oct | 16707042225651 |
9 | 3553833540864 |
10 | 1023150730153 |
11 | 364a08a06132 |
12 | 146363138ba1 |
13 | 75637651036 |
14 | 37740d6dc6d |
15 | 1b933debd6d |
hex | ee38892ba9 |
1023150730153 has 16 divisors (see below), whose sum is σ = 1062583603200. Its totient is φ = 984134221200.
The previous prime is 1023150730097. The next prime is 1023150730157. The reversal of 1023150730153 is 3510370513201.
It is a happy number.
1023150730153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1023150730153 - 213 = 1023150721961 is a prime.
It is a super-2 number, since 2×10231507301532 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1023150730157) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4093798 + ... + 4336528.
It is an arithmetic number, because the mean of its divisors is an integer number (66411475200).
Almost surely, 21023150730153 is an apocalyptic number.
It is an amenable number.
1023150730153 is a deficient number, since it is larger than the sum of its proper divisors (39432873047).
1023150730153 is a wasteful number, since it uses less digits than its factorization.
1023150730153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243588.
The product of its (nonzero) digits is 9450, while the sum is 31.
The spelling of 1023150730153 in words is "one trillion, twenty-three billion, one hundred fifty million, seven hundred thirty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •