Base | Representation |
---|---|
bin | 10010110100101000… |
… | …101011000101110011 |
3 | 1221011111111020101102 |
4 | 102310220223011303 |
5 | 312342332232243 |
6 | 13141243355015 |
7 | 1313555552246 |
oct | 226450530563 |
9 | 57144436342 |
10 | 20210430323 |
11 | 8631296486 |
12 | 3b00522a6b |
13 | 1ba1174615 |
14 | d9a22125d |
15 | 7d44859b8 |
hex | 4b4a2b173 |
20210430323 has 4 divisors (see below), whose sum is σ = 20211653880. Its totient is φ = 20209206768.
The previous prime is 20210430313. The next prime is 20210430329. The reversal of 20210430323 is 32303401202.
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 20210430323 - 210 = 20210429299 is a prime.
It is a super-2 number, since 2×202104303232 (a number of 21 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 = 20210430295 and 20210430304.
It is not an unprimeable number, because it can be changed into a prime (20210430329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 586658 + ... + 620151.
It is an arithmetic number, because the mean of its divisors is an integer number (5052913470).
Almost surely, 220210430323 is an apocalyptic number.
20210430323 is a deficient number, since it is larger than the sum of its proper divisors (1223557).
20210430323 is a wasteful number, since it uses less digits than its factorization.
20210430323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1223556.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 20210430323 its reverse (32303401202), we get a palindrome (52513831525).
The spelling of 20210430323 in words is "twenty billion, two hundred ten million, four hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •