Base | Representation |
---|---|
bin | 11101101101110010000… |
… | …11101110111111010101 |
3 | 10121121102002020021121020 |
4 | 32312321003232333111 |
5 | 113212013033404023 |
6 | 2101014010511353 |
7 | 133523425626126 |
oct | 16667103567725 |
9 | 3547362207536 |
10 | 1021012013013 |
11 | 364010733303 |
12 | 145a66a35559 |
13 | 75386528535 |
14 | 375bacc604d |
15 | 1b85b287de3 |
hex | edb90eefd5 |
1021012013013 has 4 divisors (see below), whose sum is σ = 1361349350688. Its totient is φ = 680674675340.
The previous prime is 1021012012991. The next prime is 1021012013053. The reversal of 1021012013013 is 3103102101201.
It is a happy number.
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 1021012013013 - 236 = 952292536277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021012012983 and 1021012013001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021012013053) 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, 170168668833 + ... + 170168668838.
It is an arithmetic number, because the mean of its divisors is an integer number (340337337672).
Almost surely, 21021012013013 is an apocalyptic number.
It is an amenable number.
1021012013013 is a deficient number, since it is larger than the sum of its proper divisors (340337337675).
1021012013013 is an equidigital number, since it uses as much as digits as its factorization.
1021012013013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340337337674.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1021012013013 its reverse (3103102101201), we get a palindrome (4124114114214).
The spelling of 1021012013013 in words is "one trillion, twenty-one billion, twelve million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •