Base | Representation |
---|---|
bin | 100100001010000… |
… | …1101000101011111 |
3 | 10010112221210101120 |
4 | 1020110031011133 |
5 | 4441043143111 |
6 | 320220142023 |
7 | 42031335411 |
oct | 11024150537 |
9 | 3115853346 |
10 | 1213256031 |
11 | 572940239 |
12 | 29a397913 |
13 | 1644860a0 |
14 | b71c09b1 |
15 | 717a8406 |
hex | 4850d15f |
1213256031 has 8 divisors (see below), whose sum is σ = 1742111280. Its totient is φ = 746619072.
The previous prime is 1213256029. The next prime is 1213256053. The reversal of 1213256031 is 1306523121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1213256031 - 21 = 1213256029 is a prime.
It is a super-3 number, since 3×12132560313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1213255992 and 1213256010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213256071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15554526 + ... + 15554603.
It is an arithmetic number, because the mean of its divisors is an integer number (217763910).
Almost surely, 21213256031 is an apocalyptic number.
1213256031 is a deficient number, since it is larger than the sum of its proper divisors (528855249).
1213256031 is a wasteful number, since it uses less digits than its factorization.
1213256031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31109145.
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 1213256031 is about 34831.8249737219. The cubic root of 1213256031 is about 1066.5572027101.
Adding to 1213256031 its reverse (1306523121), we get a palindrome (2519779152).
The spelling of 1213256031 in words is "one billion, two hundred thirteen million, two hundred fifty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •