Base | Representation |
---|---|
bin | 11101011110111000101… |
… | …10001100111010000001 |
3 | 10120211202200210022211202 |
4 | 32233130112030322001 |
5 | 113044123103401423 |
6 | 2053212224150545 |
7 | 133121301652010 |
oct | 16573426147201 |
9 | 3524680708752 |
10 | 1013014122113 |
11 | 360687076514 |
12 | 1443b4468455 |
13 | 746b0573406 |
14 | 3705ca0aa77 |
15 | 1b53e057728 |
hex | ebdc58ce81 |
1013014122113 has 4 divisors (see below), whose sum is σ = 1157730425280. Its totient is φ = 868297818948.
The previous prime is 1013014122101. The next prime is 1013014122139. The reversal of 1013014122113 is 3112214103101.
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 not a de Polignac number, because 1013014122113 - 28 = 1013014121857 is a prime.
It is a super-2 number, since 2×10130141221132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013014122413) 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, 72358151573 + ... + 72358151586.
It is an arithmetic number, because the mean of its divisors is an integer number (289432606320).
Almost surely, 21013014122113 is an apocalyptic number.
It is an amenable number.
1013014122113 is a deficient number, since it is larger than the sum of its proper divisors (144716303167).
1013014122113 is an equidigital number, since it uses as much as digits as its factorization.
1013014122113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144716303166.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1013014122113 its reverse (3112214103101), we get a palindrome (4125228225214).
The spelling of 1013014122113 in words is "one trillion, thirteen billion, fourteen million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •