Base | Representation |
---|---|
bin | 110000011100010101001000… |
… | …0000000111100001001010111 |
3 | 2001212201100101020210002200112 |
4 | 1200320222100000330021113 |
5 | 421322310314112222443 |
6 | 4110130241102233235 |
7 | 155516102630134121 |
oct | 14070522000741127 |
9 | 2055640336702615 |
10 | 426106121601623 |
11 | 113852656098081 |
12 | 3b95a279b8581b |
13 | 1539b833a04998 |
14 | 773190973a211 |
15 | 343dee87deb18 |
hex | 1838a9003c257 |
426106121601623 has 16 divisors (see below), whose sum is σ = 441242722438560. Its totient is φ = 410999191680000.
The previous prime is 426106121601613. The next prime is 426106121601731. The reversal of 426106121601623 is 326106121601624.
It is not a de Polignac number, because 426106121601623 - 24 = 426106121601607 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (426106121601613) 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 15 ways as a sum of consecutive naturals, for example, 200988536 + ... + 203097522.
It is an arithmetic number, because the mean of its divisors is an integer number (27577670152410).
Almost surely, 2426106121601623 is an apocalyptic number.
426106121601623 is a deficient number, since it is larger than the sum of its proper divisors (15136600836937).
426106121601623 is a wasteful number, since it uses less digits than its factorization.
426106121601623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2116018.
The product of its (nonzero) digits is 124416, while the sum is 41.
Subtracting from 426106121601623 its reverse (326106121601624), we obtain a palindrome (99999999999999).
The spelling of 426106121601623 in words is "four hundred twenty-six trillion, one hundred six billion, one hundred twenty-one million, six hundred one thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •