Base | Representation |
---|---|
bin | 101000011000101… |
… | …0011001101010101 |
3 | 10111102212021010102 |
4 | 1100301103031111 |
5 | 10233401213023 |
6 | 342244303445 |
7 | 45403111550 |
oct | 12061231525 |
9 | 3442767112 |
10 | 1355101013 |
11 | 635a124a2 |
12 | 3199a1b85 |
13 | 18798b126 |
14 | cbd85697 |
15 | 7de76628 |
hex | 50c53355 |
1355101013 has 4 divisors (see below), whose sum is σ = 1548686880. Its totient is φ = 1161515148.
The previous prime is 1355101003. The next prime is 1355101087. The reversal of 1355101013 is 3101015531.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3101015531 = 53 ⋅58509727.
It is a cyclic number.
It is not a de Polignac number, because 1355101013 - 26 = 1355100949 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 (1355101003) 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, 96792923 + ... + 96792936.
It is an arithmetic number, because the mean of its divisors is an integer number (387171720).
Almost surely, 21355101013 is an apocalyptic number.
It is an amenable number.
1355101013 is a deficient number, since it is larger than the sum of its proper divisors (193585867).
1355101013 is an equidigital number, since it uses as much as digits as its factorization.
1355101013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193585866.
The product of its (nonzero) digits is 225, while the sum is 20.
The square root of 1355101013 is about 36811.6966873302. The cubic root of 1355101013 is about 1106.5997216706.
Adding to 1355101013 its reverse (3101015531), we get a palindrome (4456116544).
The spelling of 1355101013 in words is "one billion, three hundred fifty-five million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •