Base | Representation |
---|---|
bin | 10001111001110100001… |
… | …100101001101110000010 |
3 | 11100121122102112202110102 |
4 | 101321310030221232002 |
5 | 130124133342322242 |
6 | 2341110251402402 |
7 | 154613142321533 |
oct | 21716414515602 |
9 | 4317572482412 |
10 | 1230310120322 |
11 | 434853a97108 |
12 | 17a538453402 |
13 | 8c02ccb214a |
14 | 43793c1c68a |
15 | 2200ab71e32 |
hex | 11e74329b82 |
1230310120322 has 8 divisors (see below), whose sum is σ = 1845485274000. Its totient is φ = 615148362324.
The previous prime is 1230310120321. The next prime is 1230310120381. The reversal of 1230310120322 is 2230210130321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1230310120294 and 1230310120303.
It is not an unprimeable number, because it can be changed into a prime (1230310120321) 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, 3116072 + ... + 3488627.
It is an arithmetic number, because the mean of its divisors is an integer number (230685659250).
Almost surely, 21230310120322 is an apocalyptic number.
1230310120322 is a deficient number, since it is larger than the sum of its proper divisors (615175153678).
1230310120322 is an equidigital number, since it uses as much as digits as its factorization.
1230310120322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6697840.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1230310120322 its reverse (2230210130321), we get a palindrome (3460520250643).
Subtracting 1230310120322 from its reverse (2230210130321), we obtain a palindrome (999900009999).
The spelling of 1230310120322 in words is "one trillion, two hundred thirty billion, three hundred ten million, one hundred twenty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •