Base | Representation |
---|---|
bin | 11110000000011010000… |
… | …10111011000011001001 |
3 | 10122120012221010111221102 |
4 | 33000031002323003021 |
5 | 113343002310133001 |
6 | 2105350120151145 |
7 | 134326262036663 |
oct | 17001502730311 |
9 | 3576187114842 |
10 | 1031011021001 |
11 | 36828192aa75 |
12 | 1479976084b5 |
13 | 762bac59300 |
14 | 37c88c6b533 |
15 | 1bc43eebe6b |
hex | f00d0bb0c9 |
1031011021001 has 12 divisors (see below), whose sum is σ = 1117117837980. Its totient is φ = 951107788800.
The previous prime is 1031011020979. The next prime is 1031011021009. The reversal of 1031011021001 is 1001201101301.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 129384809401 + 901626211600 = 359701^2 + 949540^2 .
It is not a de Polignac number, because 1031011021001 - 210 = 1031011019977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031011021009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1634696 + ... + 2175833.
It is an arithmetic number, because the mean of its divisors is an integer number (93093153165).
Almost surely, 21031011021001 is an apocalyptic number.
It is an amenable number.
1031011021001 is a deficient number, since it is larger than the sum of its proper divisors (86106816979).
1031011021001 is a wasteful number, since it uses less digits than its factorization.
1031011021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3812156 (or 3812143 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1031011021001 its reverse (1001201101301), we get a palindrome (2032212122302).
The spelling of 1031011021001 in words is "one trillion, thirty-one billion, eleven million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •