Base | Representation |
---|---|
bin | 11101110001111100000… |
… | …11100000011011011101 |
3 | 10121211011120211120121121 |
4 | 32320332003200123131 |
5 | 113231100242314401 |
6 | 2102023235330541 |
7 | 133632631511266 |
oct | 16707603403335 |
9 | 3554146746547 |
10 | 1023243323101 |
11 | 364a561a862a |
12 | 14638a150a51 |
13 | 756508a026c |
14 | 3774d39396d |
15 | 1b93c0dbca1 |
hex | ee3e0e06dd |
1023243323101 has 4 divisors (see below), whose sum is σ = 1023553306204. Its totient is φ = 1022933340000.
The previous prime is 1023243323017. The next prime is 1023243323119. The reversal of 1023243323101 is 1013233423201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 462197382201 + 561045940900 = 679851^2 + 749030^2 .
It is a cyclic number.
It is not a de Polignac number, because 1023243323101 - 27 = 1023243322973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023243323171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 154986600 + ... + 154993201.
It is an arithmetic number, because the mean of its divisors is an integer number (255888326551).
Almost surely, 21023243323101 is an apocalyptic number.
It is an amenable number.
1023243323101 is a deficient number, since it is larger than the sum of its proper divisors (309983103).
1023243323101 is an equidigital number, since it uses as much as digits as its factorization.
1023243323101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 309983102.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1023243323101 its reverse (1013233423201), we get a palindrome (2036476746302).
The spelling of 1023243323101 in words is "one trillion, twenty-three billion, two hundred forty-three million, three hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •