Base | Representation |
---|---|
bin | 10111011011000010010101… |
… | …010110000111111100000011 |
3 | 111111201221120011200211100210 |
4 | 113123002111112013330003 |
5 | 102000231111303412011 |
6 | 1003031304111445203 |
7 | 30461305126065234 |
oct | 2733022526077403 |
9 | 444657504624323 |
10 | 103013001232131 |
11 | 2a906628719aa1 |
12 | b678739826803 |
13 | 45631133895c3 |
14 | 1b61bda6b508b |
15 | bd991060a6a6 |
hex | 5db095587f03 |
103013001232131 has 16 divisors (see below), whose sum is σ = 137370816933120. Its totient is φ = 68665260542880.
The previous prime is 103013001232051. The next prime is 103013001232177. The reversal of 103013001232131 is 131232100310301.
It is a happy number.
It is not a de Polignac number, because 103013001232131 - 227 = 103012867014403 is a prime.
It is a super-2 number, since 2×1030130012321312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103013001232098 and 103013001232107.
It is not an unprimeable number, because it can be changed into a prime (103013001232331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 730606266 + ... + 730747248.
It is an arithmetic number, because the mean of its divisors is an integer number (8585676058320).
Almost surely, 2103013001232131 is an apocalyptic number.
103013001232131 is a deficient number, since it is larger than the sum of its proper divisors (34357815700989).
103013001232131 is a wasteful number, since it uses less digits than its factorization.
103013001232131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174986.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 103013001232131 its reverse (131232100310301), we get a palindrome (234245101542432).
The spelling of 103013001232131 in words is "one hundred three trillion, thirteen billion, one million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •