Base | Representation |
---|---|
bin | 100100101011111… |
… | …1100010101011101 |
3 | 10011210100221122222 |
4 | 1021113330111131 |
5 | 10010114410323 |
6 | 322052515125 |
7 | 42335303543 |
oct | 11127742535 |
9 | 3153327588 |
10 | 1231013213 |
11 | 5819694a1 |
12 | 2a431baa5 |
13 | 1680626b1 |
14 | b96c3d93 |
15 | 731149c8 |
hex | 495fc55d |
1231013213 has 2 divisors, whose sum is σ = 1231013214. Its totient is φ = 1231013212.
The previous prime is 1231013209. The next prime is 1231013219. The reversal of 1231013213 is 3123101321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1131851449 + 99161764 = 33643^2 + 9958^2 .
It is a cyclic number.
It is not a de Polignac number, because 1231013213 - 22 = 1231013209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1231013191 and 1231013200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1231013219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 615506606 + 615506607.
It is an arithmetic number, because the mean of its divisors is an integer number (615506607).
Almost surely, 21231013213 is an apocalyptic number.
It is an amenable number.
1231013213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1231013213 is an equidigital number, since it uses as much as digits as its factorization.
1231013213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1231013213 is about 35085.7978817641. The cubic root of 1231013213 is about 1071.7353890057.
Adding to 1231013213 its reverse (3123101321), we get a palindrome (4354114534).
It can be divided in two parts, 123101321 and 3, that multiplied together give a palindrome (369303963).
The spelling of 1231013213 in words is "one billion, two hundred thirty-one million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •