Base | Representation |
---|---|
bin | 100100001001110… |
… | …1001111011010111 |
3 | 10010112200110211221 |
4 | 1020103221323113 |
5 | 4441024041043 |
6 | 320213111211 |
7 | 42030165514 |
oct | 11023517327 |
9 | 3115613757 |
10 | 1213112023 |
11 | 572852022 |
12 | 29a328507 |
13 | 164435686 |
14 | b718430b |
15 | 7177a8ed |
hex | 484e9ed7 |
1213112023 has 8 divisors (see below), whose sum is σ = 1268142048. Its totient is φ = 1158272544.
The previous prime is 1213112011. The next prime is 1213112041. The reversal of 1213112023 is 3202113121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1213112023 - 29 = 1213111511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1213111988 and 1213112006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213112083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34536 + ... + 60157.
It is an arithmetic number, because the mean of its divisors is an integer number (158517756).
Almost surely, 21213112023 is an apocalyptic number.
1213112023 is a deficient number, since it is larger than the sum of its proper divisors (55030025).
1213112023 is an equidigital number, since it uses as much as digits as its factorization.
1213112023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95273.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1213112023 is about 34829.7577223845. The cubic root of 1213112023 is about 1066.5150025360.
Adding to 1213112023 its reverse (3202113121), we get a palindrome (4415225144).
The spelling of 1213112023 in words is "one billion, two hundred thirteen million, one hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •