Base | Representation |
---|---|
bin | 11110000111111001001… |
… | …10001100101111110001 |
3 | 10122221121000120222102222 |
4 | 33003330212030233301 |
5 | 113424220141220103 |
6 | 2111253005250425 |
7 | 134531003015300 |
oct | 17037446145761 |
9 | 3587530528388 |
10 | 1035030023153 |
11 | 369a54512855 |
12 | 148719563a15 |
13 | 767ab7a1ba9 |
14 | 3814a92a437 |
15 | 1bdcbc77638 |
hex | f0fc98cbf1 |
1035030023153 has 24 divisors (see below), whose sum is σ = 1315962768384. Its totient is φ = 808047273600.
The previous prime is 1035030023149. The next prime is 1035030023179. The reversal of 1035030023153 is 3513200305301.
It is not a de Polignac number, because 1035030023153 - 22 = 1035030023149 is a prime.
It is a super-2 number, since 2×10350300231532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1035030023123) 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 23 ways as a sum of consecutive naturals, for example, 20015033 + ... + 20066678.
It is an arithmetic number, because the mean of its divisors is an integer number (54831782016).
Almost surely, 21035030023153 is an apocalyptic number.
It is an amenable number.
1035030023153 is a deficient number, since it is larger than the sum of its proper divisors (280932745231).
1035030023153 is a wasteful number, since it uses less digits than its factorization.
1035030023153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40081773 (or 40081766 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 26.
Adding to 1035030023153 its reverse (3513200305301), we get a palindrome (4548230328454).
The spelling of 1035030023153 in words is "one trillion, thirty-five billion, thirty million, twenty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •