Base | Representation |
---|---|
bin | 110001001000110101… |
… | …1000111100001100011 |
3 | 101002101002112201002022 |
4 | 1202101223013201203 |
5 | 3212102420330220 |
6 | 120250544412055 |
7 | 10423651344332 |
oct | 1422153074143 |
9 | 332332481068 |
10 | 105523214435 |
11 | 40830115931 |
12 | 1854b61702b |
13 | 9c48b90972 |
14 | 51707dbd19 |
15 | 2b29092925 |
hex | 1891ac7863 |
105523214435 has 16 divisors (see below), whose sum is σ = 132142812480. Its totient is φ = 80742456960.
The previous prime is 105523214411. The next prime is 105523214443. The reversal of 105523214435 is 534412325501.
It is not a de Polignac number, because 105523214435 - 218 = 105522952291 is a prime.
It is a super-2 number, since 2×1055232144352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105523214395 and 105523214404.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2336165 + ... + 2380905.
It is an arithmetic number, because the mean of its divisors is an integer number (8258925780).
Almost surely, 2105523214435 is an apocalyptic number.
105523214435 is a deficient number, since it is larger than the sum of its proper divisors (26619598045).
105523214435 is a wasteful number, since it uses less digits than its factorization.
105523214435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65278.
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 105523214435 its reverse (534412325501), we get a palindrome (639935539936).
The spelling of 105523214435 in words is "one hundred five billion, five hundred twenty-three million, two hundred fourteen thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •