Base | Representation |
---|---|
bin | 1000011011000111… |
… | …0101111101011111 |
3 | 12211120212112010111 |
4 | 2012301311331133 |
5 | 14112332304043 |
6 | 1012213350451 |
7 | 110014664536 |
oct | 20661657537 |
9 | 5746775114 |
10 | 2261213023 |
11 | a604398a3 |
12 | 531338427 |
13 | 2a0614794 |
14 | 17645331d |
15 | d37ae09d |
hex | 86c75f5f |
2261213023 has 4 divisors (see below), whose sum is σ = 2264730328. Its totient is φ = 2257695720.
The previous prime is 2261212999. The next prime is 2261213039. The reversal of 2261213023 is 3203121622.
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 2261213023 - 221 = 2259115871 is a prime.
It is a super-2 number, since 2×22612130232 = 10226168670769597058, 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 = 2261212985 and 2261213003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2261213063) 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, 1757688 + ... + 1758973.
It is an arithmetic number, because the mean of its divisors is an integer number (566182582).
Almost surely, 22261213023 is an apocalyptic number.
2261213023 is a deficient number, since it is larger than the sum of its proper divisors (3517305).
2261213023 is an equidigital number, since it uses as much as digits as its factorization.
2261213023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3517304.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 2261213023 is about 47552.2136498397. The cubic root of 2261213023 is about 1312.5438639067.
Adding to 2261213023 its reverse (3203121622), we get a palindrome (5464334645).
The spelling of 2261213023 in words is "two billion, two hundred sixty-one million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •