Base | Representation |
---|---|
bin | 110000111001111100… |
… | …0101001000111100011 |
3 | 101001002021010201010222 |
4 | 1201303320221013203 |
5 | 3210042000142202 |
6 | 120125212513255 |
7 | 10405402353110 |
oct | 1416370510743 |
9 | 331067121128 |
10 | 105023443427 |
11 | 405a3aa5541 |
12 | 1843017b82b |
13 | 9b99488b86 |
14 | 51242a5907 |
15 | 2aea2724a2 |
hex | 1873e291e3 |
105023443427 has 8 divisors (see below), whose sum is σ = 121818237696. Its totient is φ = 88676510472.
The previous prime is 105023443409. The next prime is 105023443451. The reversal of 105023443427 is 724344320501.
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 105023443427 - 214 = 105023427043 is a prime.
It is a super-2 number, since 2×1050234434272 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105023443457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111964823 + ... + 111965760.
It is an arithmetic number, because the mean of its divisors is an integer number (15227279712).
Almost surely, 2105023443427 is an apocalyptic number.
105023443427 is a deficient number, since it is larger than the sum of its proper divisors (16794794269).
105023443427 is an equidigital number, since it uses as much as digits as its factorization.
105023443427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223930657.
The product of its (nonzero) digits is 80640, while the sum is 35.
Adding to 105023443427 its reverse (724344320501), we get a palindrome (829367763928).
The spelling of 105023443427 in words is "one hundred five billion, twenty-three million, four hundred forty-three thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •