Base | Representation |
---|---|
bin | 100100101010101… |
… | …0000111001101101 |
3 | 10011202001021102212 |
4 | 1021111100321231 |
5 | 10004424423041 |
6 | 322025500205 |
7 | 42326320412 |
oct | 11125207155 |
9 | 3152037385 |
10 | 1230311021 |
11 | 581529975 |
12 | 2a4041665 |
13 | 167b77bb4 |
14 | b9580109 |
15 | 730268eb |
hex | 49550e6d |
1230311021 has 4 divisors (see below), whose sum is σ = 1232880000. Its totient is φ = 1227742044.
The previous prime is 1230310987. The next prime is 1230311023. The reversal of 1230311021 is 1201130321.
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 a cyclic number.
It is not a de Polignac number, because 1230311021 - 218 = 1230048877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1230310987 and 1230311005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230311023) 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, 1283771 + ... + 1284728.
It is an arithmetic number, because the mean of its divisors is an integer number (308220000).
Almost surely, 21230311021 is an apocalyptic number.
It is an amenable number.
1230311021 is a deficient number, since it is larger than the sum of its proper divisors (2568979).
1230311021 is an equidigital number, since it uses as much as digits as its factorization.
1230311021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2568978.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1230311021 is about 35075.7896703695. The cubic root of 1230311021 is about 1071.5315712222.
Adding to 1230311021 its reverse (1201130321), we get a palindrome (2431441342).
The spelling of 1230311021 in words is "one billion, two hundred thirty million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •