Base | Representation |
---|---|
bin | 10111011011000100011111… |
… | …110111000110100101001011 |
3 | 111111202011120010112020020012 |
4 | 113123010133313012211023 |
5 | 102000300341213230011 |
6 | 1003032330445022135 |
7 | 30461416534653635 |
oct | 2733043767064513 |
9 | 444664503466205 |
10 | 103015325133131 |
11 | 2a907610485234 |
12 | b679087b5494b |
13 | 45633c397c658 |
14 | 1b61d7b1a5a55 |
15 | bd99e964da8b |
hex | 5db11fdc694b |
103015325133131 has 2 divisors, whose sum is σ = 103015325133132. Its totient is φ = 103015325133130.
The previous prime is 103015325133103. The next prime is 103015325133143. The reversal of 103015325133131 is 131331523510301.
It is a strong prime.
It is an emirp because it is prime and its reverse (131331523510301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103015325133131 is a prime.
It is a super-2 number, since 2×1030153251331312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103015325433131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51507662566565 + 51507662566566.
It is an arithmetic number, because the mean of its divisors is an integer number (51507662566566).
Almost surely, 2103015325133131 is an apocalyptic number.
103015325133131 is a deficient number, since it is larger than the sum of its proper divisors (1).
103015325133131 is an equidigital number, since it uses as much as digits as its factorization.
103015325133131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12150, while the sum is 32.
Adding to 103015325133131 its reverse (131331523510301), we get a palindrome (234346848643432).
The spelling of 103015325133131 in words is "one hundred three trillion, fifteen billion, three hundred twenty-five million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •