Base | Representation |
---|---|
bin | 100100101010110… |
… | …1000010100111101 |
3 | 10011202020011001122 |
4 | 1021111220110331 |
5 | 10004441010343 |
6 | 322031520325 |
7 | 42330200225 |
oct | 11125502475 |
9 | 3152204048 |
10 | 1230406973 |
11 | 581594a74 |
12 | 2a40890a5 |
13 | 167bac783 |
14 | b95a7085 |
15 | 73045068 |
hex | 4956853d |
1230406973 has 4 divisors (see below), whose sum is σ = 1230614748. Its totient is φ = 1230199200.
The previous prime is 1230406963. The next prime is 1230406981. The reversal of 1230406973 is 3796040321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3796040321 = 34843 ⋅108947.
It can be written as a sum of positive squares in 2 ways, for example, as 259274404 + 971132569 = 16102^2 + 31163^2 .
It is a cyclic number.
It is not a de Polignac number, because 1230406973 - 210 = 1230405949 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230406963) 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, 94736 + ... + 106937.
It is an arithmetic number, because the mean of its divisors is an integer number (307653687).
Almost surely, 21230406973 is an apocalyptic number.
It is an amenable number.
1230406973 is a deficient number, since it is larger than the sum of its proper divisors (207775).
1230406973 is an equidigital number, since it uses as much as digits as its factorization.
1230406973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207774.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 1230406973 is about 35077.1574247401. The cubic root of 1230406973 is about 1071.5594267598.
The spelling of 1230406973 in words is "one billion, two hundred thirty million, four hundred six thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •