Base | Representation |
---|---|
bin | 110001001000110100… |
… | …0111001010101010111 |
3 | 101002101001110010011111 |
4 | 1202101220321111113 |
5 | 3212102243211043 |
6 | 120250524115451 |
7 | 10423643400334 |
oct | 1422150712527 |
9 | 332331403144 |
10 | 105522632023 |
11 | 4082a8582a6 |
12 | 1854b395b87 |
13 | 9c48a18843 |
14 | 51706c998b |
15 | 2b28eca09d |
hex | 1891a39557 |
105522632023 has 4 divisors (see below), whose sum is σ = 105535941688. Its totient is φ = 105509322360.
The previous prime is 105522632009. The next prime is 105522632099. The reversal of 105522632023 is 320236225501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320236225501 = 479 ⋅668551619.
It is a cyclic number.
It is not a de Polignac number, because 105522632023 - 213 = 105522623831 is a prime.
It is a super-2 number, since 2×1055226320232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105522632123) 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, 6642933 + ... + 6658798.
It is an arithmetic number, because the mean of its divisors is an integer number (26383985422).
Almost surely, 2105522632023 is an apocalyptic number.
105522632023 is a deficient number, since it is larger than the sum of its proper divisors (13309665).
105522632023 is an equidigital number, since it uses as much as digits as its factorization.
105522632023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13309664.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 105522632023 its reverse (320236225501), we get a palindrome (425758857524).
The spelling of 105522632023 in words is "one hundred five billion, five hundred twenty-two million, six hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •