Base | Representation |
---|---|
bin | 11101011101100111100… |
… | …01000100100100110101 |
3 | 10120210000020200222111201 |
4 | 32232303301010210311 |
5 | 113041224311100041 |
6 | 2053020503532501 |
7 | 133065364033651 |
oct | 16566361044465 |
9 | 3523006628451 |
10 | 1012333300021 |
11 | 36036783582a |
12 | 14424445a131 |
13 | 746024ba1c4 |
14 | 36dd6425a61 |
15 | 1b4ee3c2631 |
hex | ebb3c44935 |
1012333300021 has 4 divisors (see below), whose sum is σ = 1012344876652. Its totient is φ = 1012321723392.
The previous prime is 1012333299997. The next prime is 1012333300037. The reversal of 1012333300021 is 1200033332101.
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 873778127121 + 138555172900 = 934761^2 + 372230^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012333300021 - 27 = 1012333299893 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 (1012333309021) 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, 5656140 + ... + 5832373.
It is an arithmetic number, because the mean of its divisors is an integer number (253086219163).
Almost surely, 21012333300021 is an apocalyptic number.
It is an amenable number.
1012333300021 is a deficient number, since it is larger than the sum of its proper divisors (11576631).
1012333300021 is an equidigital number, since it uses as much as digits as its factorization.
1012333300021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11576630.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1012333300021 its reverse (1200033332101), we get a palindrome (2212366632122).
The spelling of 1012333300021 in words is "one trillion, twelve billion, three hundred thirty-three million, three hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •