Base | Representation |
---|---|
bin | 1100010100011101011… |
… | …01111100010110000011 |
3 | 1111110121120220010212121 |
4 | 12022032231330112003 |
5 | 23413410102001311 |
6 | 522243433505111 |
7 | 42403540601266 |
oct | 6121655742603 |
9 | 1443546803777 |
10 | 423301203331 |
11 | 153580548336 |
12 | 6a056872197 |
13 | 30bbcc29c16 |
14 | 166b8a98cdd |
15 | b0273a3b71 |
hex | 628eb7c583 |
423301203331 has 4 divisors (see below), whose sum is σ = 434741776432. Its totient is φ = 411860630232.
The previous prime is 423301203263. The next prime is 423301203343. The reversal of 423301203331 is 133302103324.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 423301203331 - 227 = 423166985603 is a prime.
It is a super-2 number, since 2×4233012033312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 423301203296 and 423301203305.
It is not an unprimeable number, because it can be changed into a prime (423301203361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5720286495 + ... + 5720286568.
It is an arithmetic number, because the mean of its divisors is an integer number (108685444108).
Almost surely, 2423301203331 is an apocalyptic number.
423301203331 is a deficient number, since it is larger than the sum of its proper divisors (11440573101).
423301203331 is a wasteful number, since it uses less digits than its factorization.
423301203331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11440573100.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 423301203331 its reverse (133302103324), we get a palindrome (556603306655).
The spelling of 423301203331 in words is "four hundred twenty-three billion, three hundred one million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •