Base | Representation |
---|---|
bin | 11101110001100000100… |
… | …01100111110000010101 |
3 | 10121210120110211100220100 |
4 | 32320300101213300111 |
5 | 113230112102021401 |
6 | 2101544300324313 |
7 | 133624123506225 |
oct | 16706021476025 |
9 | 3553513740810 |
10 | 1023012142101 |
11 | 364947758954 |
12 | 146324843699 |
13 | 75614a19581 |
14 | 3772a7b6085 |
15 | 1b926b73b86 |
hex | ee30467c15 |
1023012142101 has 24 divisors (see below), whose sum is σ = 1579539439296. Its totient is φ = 636444452160.
The previous prime is 1023012142073. The next prime is 1023012142109. The reversal of 1023012142101 is 1012412103201.
1023012142101 is a `hidden beast` number, since 1 + 0 + 230 + 12 + 1 + 421 + 0 + 1 = 666.
It is not a de Polignac number, because 1023012142101 - 218 = 1023011879957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023012142109) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 60260875 + ... + 60277848.
It is an arithmetic number, because the mean of its divisors is an integer number (65814143304).
Almost surely, 21023012142101 is an apocalyptic number.
It is an amenable number.
1023012142101 is a deficient number, since it is larger than the sum of its proper divisors (556527297195).
1023012142101 is a wasteful number, since it uses less digits than its factorization.
1023012142101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120538793 (or 120538790 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1023012142101 its reverse (1012412103201), we get a palindrome (2035424245302).
The spelling of 1023012142101 in words is "one trillion, twenty-three billion, twelve million, one hundred forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •