Base | Representation |
---|---|
bin | 100100000110011… |
… | …0010101101111111 |
3 | 10010102022002002022 |
4 | 1020030302231333 |
5 | 4440044004043 |
6 | 320110350355 |
7 | 42005663564 |
oct | 11014625577 |
9 | 3112262068 |
10 | 1211313023 |
11 | 571833448 |
12 | 2997bb3bb |
13 | 163c5588b |
14 | b6c3686b |
15 | 71522868 |
hex | 48332b7f |
1211313023 has 8 divisors (see below), whose sum is σ = 1281745920. Its totient is φ = 1141548120.
The previous prime is 1211312989. The next prime is 1211313049. The reversal of 1211313023 is 3203131121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1211313023 - 216 = 1211247487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1211312992 and 1211313010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211312023) 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, 163265 + ... + 170522.
It is an arithmetic number, because the mean of its divisors is an integer number (160218240).
Almost surely, 21211313023 is an apocalyptic number.
1211313023 is a deficient number, since it is larger than the sum of its proper divisors (70432897).
1211313023 is a wasteful number, since it uses less digits than its factorization.
1211313023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333997.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1211313023 is about 34803.9225231870. The cubic root of 1211313023 is about 1065.9875410240.
Adding to 1211313023 its reverse (3203131121), we get a palindrome (4414444144).
The spelling of 1211313023 in words is "one billion, two hundred eleven million, three hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •