Base | Representation |
---|---|
bin | 11101011111011001010… |
… | …00000100010111000101 |
3 | 10120212110201201012201220 |
4 | 32233230220010113011 |
5 | 113100203013204112 |
6 | 2053255302110553 |
7 | 133131126303312 |
oct | 16575450042705 |
9 | 3525421635656 |
10 | 1013287241157 |
11 | 36080725a934 |
12 | 14446ba1b459 |
13 | 7472501bb09 |
14 | 37086dc3d09 |
15 | 1b55800698c |
hex | ebeca045c5 |
1013287241157 has 4 divisors (see below), whose sum is σ = 1351049654880. Its totient is φ = 675524827436.
The previous prime is 1013287241143. The next prime is 1013287241201. The reversal of 1013287241157 is 7511427823101.
1013287241157 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
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 1013287241157 - 236 = 944567764421 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013287241137) 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, 168881206857 + ... + 168881206862.
It is an arithmetic number, because the mean of its divisors is an integer number (337762413720).
Almost surely, 21013287241157 is an apocalyptic number.
It is an amenable number.
1013287241157 is a deficient number, since it is larger than the sum of its proper divisors (337762413723).
1013287241157 is an equidigital number, since it uses as much as digits as its factorization.
1013287241157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337762413722.
The product of its (nonzero) digits is 94080, while the sum is 42.
The spelling of 1013287241157 in words is "one trillion, thirteen billion, two hundred eighty-seven million, two hundred forty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •