Base | Representation |
---|---|
bin | 1100010100100000111… |
… | …00100011101011101101 |
3 | 1111110200121110100020110 |
4 | 12022100130203223231 |
5 | 23413440012402201 |
6 | 522250351210233 |
7 | 42404342221461 |
oct | 6122034435355 |
9 | 1443617410213 |
10 | 423330200301 |
11 | 153595953178 |
12 | 6a064516979 |
13 | 30bc5c404a8 |
14 | 166bc8864a1 |
15 | b029bd06d6 |
hex | 6290723aed |
423330200301 has 4 divisors (see below), whose sum is σ = 564440267072. Its totient is φ = 282220133532.
The previous prime is 423330200299. The next prime is 423330200323. The reversal of 423330200301 is 103002033324.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 423330200301 - 21 = 423330200299 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 (423330205301) 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 3 ways as a sum of consecutive naturals, for example, 70555033381 + ... + 70555033386.
It is an arithmetic number, because the mean of its divisors is an integer number (141110066768).
Almost surely, 2423330200301 is an apocalyptic number.
It is an amenable number.
423330200301 is a deficient number, since it is larger than the sum of its proper divisors (141110066771).
423330200301 is a wasteful number, since it uses less digits than its factorization.
423330200301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141110066770.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 423330200301 its reverse (103002033324), we get a palindrome (526332233625).
The spelling of 423330200301 in words is "four hundred twenty-three billion, three hundred thirty million, two hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •