Base | Representation |
---|---|
bin | 1100010100001000001… |
… | …11110101100101011011 |
3 | 1111110011012101221012000 |
4 | 12022010013311211123 |
5 | 23413024100121021 |
6 | 522214043452043 |
7 | 42366251625564 |
oct | 6120407654533 |
9 | 1443135357160 |
10 | 423123442011 |
11 | 15349a174656 |
12 | 6a007227023 |
13 | 30b9215acca |
14 | 1669d22516b |
15 | b01698db26 |
hex | 62841f595b |
423123442011 has 32 divisors (see below), whose sum is σ = 644095932480. Its totient is φ = 274328633088.
The previous prime is 423123442003. The next prime is 423123442033. The reversal of 423123442011 is 110244321324.
423123442011 is a `hidden beast` number, since 4 + 2 + 3 + 1 + 234 + 420 + 1 + 1 = 666.
It is not a de Polignac number, because 423123442011 - 23 = 423123442003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (423123442061) 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, 2035765 + ... + 2233961.
It is an arithmetic number, because the mean of its divisors is an integer number (20127997890).
Almost surely, 2423123442011 is an apocalyptic number.
423123442011 is a deficient number, since it is larger than the sum of its proper divisors (220972490469).
423123442011 is a wasteful number, since it uses less digits than its factorization.
423123442011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200380 (or 200374 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 423123442011 its reverse (110244321324), we get a palindrome (533367763335).
The spelling of 423123442011 in words is "four hundred twenty-three billion, one hundred twenty-three million, four hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •