Base | Representation |
---|---|
bin | 1011111010101100011111… |
… | …0011001000000101001111 |
3 | 1201101122010202112120222211 |
4 | 2332223013303020011033 |
5 | 3204134422043234411 |
6 | 43511234113451251 |
7 | 2521442420031124 |
oct | 276530763100517 |
9 | 51348122476884 |
10 | 13103002321231 |
11 | 41a1a52241209 |
12 | 1577548b70b27 |
13 | 7407b94b2aa4 |
14 | 33428dad474b |
15 | 17ac8c273221 |
hex | beac7cc814f |
13103002321231 has 4 divisors (see below), whose sum is σ = 13672698074352. Its totient is φ = 12533306568112.
The previous prime is 13103002321217. The next prime is 13103002321237. The reversal of 13103002321231 is 13212320030131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13103002321231 - 227 = 13102868103503 is a prime.
It is a super-2 number, since 2×131030023212312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13103002321237) 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, 284847876526 + ... + 284847876571.
It is an arithmetic number, because the mean of its divisors is an integer number (3418174518588).
Almost surely, 213103002321231 is an apocalyptic number.
13103002321231 is a deficient number, since it is larger than the sum of its proper divisors (569695753121).
13103002321231 is an equidigital number, since it uses as much as digits as its factorization.
13103002321231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 569695753120.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13103002321231 its reverse (13212320030131), we get a palindrome (26315322351362).
The spelling of 13103002321231 in words is "thirteen trillion, one hundred three billion, two million, three hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •