Base | Representation |
---|---|
bin | 110000100000010100110000… |
… | …1110100100010101100110111 |
3 | 2001221122211101200000212110012 |
4 | 1201000221201310202230313 |
5 | 421410304122204213443 |
6 | 4111230352002250435 |
7 | 155603546114060606 |
oct | 14100514164425467 |
9 | 2057584350025405 |
10 | 426655102413623 |
11 | 113a4445a489596 |
12 | 3ba2874a656a1b |
13 | 1540b5326c7645 |
14 | 7750307b89a3d |
15 | 344d429596118 |
hex | 1840a61d22b37 |
426655102413623 has 8 divisors (see below), whose sum is σ = 426808968284592. Its totient is φ = 426501262851136.
The previous prime is 426655102413611. The next prime is 426655102413691. The reversal of 426655102413623 is 326314201556624.
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 426655102413623 - 212 = 426655102409527 is a prime.
It is a super-2 number, since 2×4266551024136232 (a number of 30 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 (426655102413223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25892411 + ... + 39034947.
It is an arithmetic number, because the mean of its divisors is an integer number (53351121035574).
Almost surely, 2426655102413623 is an apocalyptic number.
426655102413623 is a deficient number, since it is larger than the sum of its proper divisors (153865870969).
426655102413623 is a wasteful number, since it uses less digits than its factorization.
426655102413623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13154241.
The product of its (nonzero) digits is 6220800, while the sum is 50.
The spelling of 426655102413623 in words is "four hundred twenty-six trillion, six hundred fifty-five billion, one hundred two million, four hundred thirteen thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •