Base | Representation |
---|---|
bin | 11110000000011010001… |
… | …11111010111000000101 |
3 | 10122120020000121001221101 |
4 | 33000031013322320011 |
5 | 113343003124043023 |
6 | 2105350204220101 |
7 | 134326306134160 |
oct | 17001507727005 |
9 | 3576200531841 |
10 | 1031012331013 |
11 | 368282645225 |
12 | 147997b3a631 |
13 | 762bb2c7672 |
14 | 37c890ccad7 |
15 | 1bc441aa1ad |
hex | f00d1fae05 |
1031012331013 has 4 divisors (see below), whose sum is σ = 1178299806880. Its totient is φ = 883724855148.
The previous prime is 1031012330993. The next prime is 1031012331067. The reversal of 1031012331013 is 3101332101301.
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 1031012331013 - 229 = 1030475460101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031012331913) 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, 73643737923 + ... + 73643737936.
It is an arithmetic number, because the mean of its divisors is an integer number (294574951720).
Almost surely, 21031012331013 is an apocalyptic number.
It is an amenable number.
1031012331013 is a deficient number, since it is larger than the sum of its proper divisors (147287475867).
1031012331013 is an equidigital number, since it uses as much as digits as its factorization.
1031012331013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147287475866.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1031012331013 its reverse (3101332101301), we get a palindrome (4132344432314).
The spelling of 1031012331013 in words is "one trillion, thirty-one billion, twelve million, three hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.079 sec. • engine limits •