Base | Representation |
---|---|
bin | 100100001001101… |
… | …0010010010111111 |
3 | 10010112111120002001 |
4 | 1020103102102333 |
5 | 4441012441411 |
6 | 320211043131 |
7 | 42026313361 |
oct | 11023222277 |
9 | 3115446061 |
10 | 1213015231 |
11 | 57279632a |
12 | 29a2a04a7 |
13 | 1644005bc |
14 | b715ad31 |
15 | 7175bdc1 |
hex | 484d24bf |
1213015231 has 4 divisors (see below), whose sum is σ = 1229631952. Its totient is φ = 1196398512.
The previous prime is 1213015207. The next prime is 1213015267. The reversal of 1213015231 is 1325103121.
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 1213015231 - 213 = 1213007039 is a prime.
It is a super-2 number, since 2×12130152312 = 2942811901275966722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1213015199 and 1213015208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213015291) 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, 8308251 + ... + 8308396.
It is an arithmetic number, because the mean of its divisors is an integer number (307407988).
Almost surely, 21213015231 is an apocalyptic number.
1213015231 is a deficient number, since it is larger than the sum of its proper divisors (16616721).
1213015231 is an equidigital number, since it uses as much as digits as its factorization.
1213015231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16616720.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 1213015231 is about 34828.3681931841. The cubic root of 1213015231 is about 1066.4866366847.
Adding to 1213015231 its reverse (1325103121), we get a palindrome (2538118352).
The spelling of 1213015231 in words is "one billion, two hundred thirteen million, fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •