Base | Representation |
---|---|
bin | 110000001010001001000001… |
… | …0100101000101100010111101 |
3 | 2001112212100201011201101220110 |
4 | 1200110102002211011202331 |
5 | 421010331022124330023 |
6 | 4100534002515140233 |
7 | 155140353104443110 |
oct | 14024220245054275 |
9 | 2045770634641813 |
10 | 423606225230013 |
11 | 112a794338293a1 |
12 | 3b6158838a4679 |
13 | 15249b84936a27 |
14 | 7686917720577 |
15 | 33e8e83d4da93 |
hex | 18144829458bd |
423606225230013 has 32 divisors (see below), whose sum is σ = 657136988477440. Its totient is φ = 237707850951360.
The previous prime is 423606225230011. The next prime is 423606225230017. The reversal of 423606225230013 is 310032522606324.
It is not a de Polignac number, because 423606225230013 - 21 = 423606225230011 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 (423606225230011) 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 31 ways as a sum of consecutive naturals, for example, 266318545 + ... + 267904422.
It is an arithmetic number, because the mean of its divisors is an integer number (20535530889920).
Almost surely, 2423606225230013 is an apocalyptic number.
It is an amenable number.
423606225230013 is a deficient number, since it is larger than the sum of its proper divisors (233530763247427).
423606225230013 is a wasteful number, since it uses less digits than its factorization.
423606225230013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534223657.
The product of its (nonzero) digits is 311040, while the sum is 39.
Adding to 423606225230013 its reverse (310032522606324), we get a palindrome (733638747836337).
The spelling of 423606225230013 in words is "four hundred twenty-three trillion, six hundred six billion, two hundred twenty-five million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •