Base | Representation |
---|---|
bin | 10110111101111011101101… |
… | …001111000000110100000101 |
3 | 111020122202021010001102221121 |
4 | 112331323231033000310011 |
5 | 101214444131334044023 |
6 | 554500424034313541 |
7 | 30163643553453220 |
oct | 2675735517006405 |
9 | 436582233042847 |
10 | 101013021003013 |
11 | 2a205421a52389 |
12 | b3b50004288b1 |
13 | 4449643c582a2 |
14 | 1ad30b06d05b7 |
15 | ba28a9235d5d |
hex | 5bdeed3c0d05 |
101013021003013 has 4 divisors (see below), whose sum is σ = 115443452574880. Its totient is φ = 86582589431148.
The previous prime is 101013021002977. The next prime is 101013021003023. The reversal of 101013021003013 is 310300120310101.
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 101013021003013 - 233 = 101004431068421 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 (101013021003023) 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, 7215215785923 + ... + 7215215785936.
It is an arithmetic number, because the mean of its divisors is an integer number (28860863143720).
Almost surely, 2101013021003013 is an apocalyptic number.
It is an amenable number.
101013021003013 is a deficient number, since it is larger than the sum of its proper divisors (14430431571867).
101013021003013 is an equidigital number, since it uses as much as digits as its factorization.
101013021003013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14430431571866.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 101013021003013 its reverse (310300120310101), we get a palindrome (411313141313114).
The spelling of 101013021003013 in words is "one hundred one trillion, thirteen billion, twenty-one million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •