Base | Representation |
---|---|
bin | 1001001100000010110011… |
… | …0001000010000010110011 |
3 | 1022202210100120122200121121 |
4 | 2103000230301002002303 |
5 | 2311004422104143443 |
6 | 33253010402403111 |
7 | 2061611501155201 |
oct | 223005461020263 |
9 | 38683316580547 |
10 | 10102514131123 |
11 | 32454a7945037 |
12 | 1171b27660497 |
13 | 5838807a43cb |
14 | 26cd7003c071 |
15 | 127bc9c4a4ed |
hex | 9302cc420b3 |
10102514131123 has 4 divisors (see below), whose sum is σ = 10105376847640. Its totient is φ = 10099651414608.
The previous prime is 10102514131111. The next prime is 10102514131139. The reversal of 10102514131123 is 32113141520101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10102514131123 is a prime.
It is a super-2 number, since 2×101025141311232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10102514131103) 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, 1431352965 + ... + 1431360022.
It is an arithmetic number, because the mean of its divisors is an integer number (2526344211910).
Almost surely, 210102514131123 is an apocalyptic number.
10102514131123 is a deficient number, since it is larger than the sum of its proper divisors (2862716517).
10102514131123 is an equidigital number, since it uses as much as digits as its factorization.
10102514131123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2862716516.
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 10102514131123 its reverse (32113141520101), we get a palindrome (42215655651224).
The spelling of 10102514131123 in words is "ten trillion, one hundred two billion, five hundred fourteen million, one hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •