Base | Representation |
---|---|
bin | 11101110001111101001… |
… | …01000000101100010001 |
3 | 10121211012012100210111012 |
4 | 32320332211000230101 |
5 | 113231110014343001 |
6 | 2102024151500305 |
7 | 133633066251356 |
oct | 16707645005421 |
9 | 3554165323435 |
10 | 1023252106001 |
11 | 364a60157324 |
12 | 146391087695 |
13 | 75652656b48 |
14 | 377505dc62d |
15 | 1b93cc742bb |
hex | ee3e940b11 |
1023252106001 has 16 divisors (see below), whose sum is σ = 1102842618768. Its totient is φ = 945926553600.
The previous prime is 1023252105983. The next prime is 1023252106067. The reversal of 1023252106001 is 1006012523201.
It can be written as a sum of positive squares in 8 ways, for example, as 330137579776 + 693114526225 = 574576^2 + 832535^2 .
It is a cyclic number.
It is not a de Polignac number, because 1023252106001 - 210 = 1023252104977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1023252106091) 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 15 ways as a sum of consecutive naturals, for example, 1411580 + ... + 2009741.
It is an arithmetic number, because the mean of its divisors is an integer number (68927663673).
Almost surely, 21023252106001 is an apocalyptic number.
It is an amenable number.
1023252106001 is a deficient number, since it is larger than the sum of its proper divisors (79590512767).
1023252106001 is a wasteful number, since it uses less digits than its factorization.
1023252106001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3421652.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 1023252106001 its reverse (1006012523201), we get a palindrome (2029264629202).
The spelling of 1023252106001 in words is "one trillion, twenty-three billion, two hundred fifty-two million, one hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •