Base | Representation |
---|---|
bin | 11110000000011010001… |
… | …11000101011011100101 |
3 | 10122120020000011221122112 |
4 | 33000031013011123211 |
5 | 113343003100041401 |
6 | 2105350155410405 |
7 | 134326304233016 |
oct | 17001507053345 |
9 | 3576200157575 |
10 | 1031012112101 |
11 | 368282505804 |
12 | 147997a53a05 |
13 | 762bb24bb2a |
14 | 37c8907300d |
15 | 1bc441653bb |
hex | f00d1c56e5 |
1031012112101 has 4 divisors (see below), whose sum is σ = 1031105149632. Its totient is φ = 1030919074572.
The previous prime is 1031012112079. The next prime is 1031012112131. The reversal of 1031012112101 is 1012112101301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1031012112101 - 230 = 1029938370277 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 (1031012112131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46502141 + ... + 46524306.
It is an arithmetic number, because the mean of its divisors is an integer number (257776287408).
Almost surely, 21031012112101 is an apocalyptic number.
It is an amenable number.
1031012112101 is a deficient number, since it is larger than the sum of its proper divisors (93037531).
1031012112101 is an equidigital number, since it uses as much as digits as its factorization.
1031012112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93037530.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1031012112101 its reverse (1012112101301), we get a palindrome (2043124213402).
The spelling of 1031012112101 in words is "one trillion, thirty-one billion, twelve million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •