Base | Representation |
---|---|
bin | 11101101110010101101… |
… | …00111011110011011111 |
3 | 10121122011212011211221102 |
4 | 32313022310323303133 |
5 | 113213120342420411 |
6 | 2101103340223315 |
7 | 133534005545126 |
oct | 16671264736337 |
9 | 3548155154842 |
10 | 1021310123231 |
11 | 364153a36992 |
12 | 145b2a83ab3b |
13 | 75403214108 |
14 | 37608726abd |
15 | 1b877521d3b |
hex | edcad3bcdf |
1021310123231 has 4 divisors (see below), whose sum is σ = 1021348764000. Its totient is φ = 1021271482464.
The previous prime is 1021310123221. The next prime is 1021310123237. The reversal of 1021310123231 is 1323210131201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1021310123231 - 210 = 1021310122207 is a prime.
It is a super-3 number, since 3×10213101232313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021310123237) 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, 19280711 + ... + 19333608.
It is an arithmetic number, because the mean of its divisors is an integer number (255337191000).
Almost surely, 21021310123231 is an apocalyptic number.
1021310123231 is a deficient number, since it is larger than the sum of its proper divisors (38640769).
1021310123231 is an equidigital number, since it uses as much as digits as its factorization.
1021310123231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38640768.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1021310123231 its reverse (1323210131201), we get a palindrome (2344520254432).
The spelling of 1021310123231 in words is "one trillion, twenty-one billion, three hundred ten million, one hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •