Base | Representation |
---|---|
bin | 11101011111010010110… |
… | …01101001111001011101 |
3 | 10120212022221220010200202 |
4 | 32233221121221321131 |
5 | 113100100140143401 |
6 | 2053250050233245 |
7 | 133126601340122 |
oct | 16575131517135 |
9 | 3525287803622 |
10 | 1013233131101 |
11 | 360789762184 |
12 | 144455885825 |
13 | 74716a54a29 |
14 | 3707db3a749 |
15 | 1b5533b906b |
hex | ebe9669e5d |
1013233131101 has 4 divisors (see below), whose sum is σ = 1022199796092. Its totient is φ = 1004266466112.
The previous prime is 1013233131083. The next prime is 1013233131143. The reversal of 1013233131101 is 1011313323101.
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 443549340025 + 569683791076 = 665995^2 + 754774^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013233131101 - 26 = 1013233131037 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 (1013233031101) 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, 4483332326 + ... + 4483332551.
It is an arithmetic number, because the mean of its divisors is an integer number (255549949023).
Almost surely, 21013233131101 is an apocalyptic number.
It is an amenable number.
1013233131101 is a deficient number, since it is larger than the sum of its proper divisors (8966664991).
1013233131101 is an equidigital number, since it uses as much as digits as its factorization.
1013233131101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8966664990.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1013233131101 its reverse (1011313323101), we get a palindrome (2024546454202).
The spelling of 1013233131101 in words is "one trillion, thirteen billion, two hundred thirty-three million, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •