Base | Representation |
---|---|
bin | 101111000000010010010… |
… | …010110010000011111011 |
3 | 102102210111210000100222120 |
4 | 233000102102302003323 |
5 | 410410242303220443 |
6 | 10511521523252323 |
7 | 452240304463266 |
oct | 57002222620373 |
9 | 12383453010876 |
10 | 3230122320123 |
11 | 1035983927916 |
12 | 44202951a0a3 |
13 | 1a57a367112a |
14 | b24a5783cdd |
15 | 59052405083 |
hex | 2f0124b20fb |
3230122320123 has 8 divisors (see below), whose sum is σ = 4323587853648. Its totient is φ = 2145035833344.
The previous prime is 3230122320077. The next prime is 3230122320199. The reversal of 3230122320123 is 3210232210323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3230122320123 - 28 = 3230122319867 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3230122320093 and 3230122320102.
It is not an unprimeable number, because it can be changed into a prime (3230122320923) 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 7 ways as a sum of consecutive naturals, for example, 2094760786 + ... + 2094762327.
It is an arithmetic number, because the mean of its divisors is an integer number (540448481706).
Almost surely, 23230122320123 is an apocalyptic number.
3230122320123 is a deficient number, since it is larger than the sum of its proper divisors (1093465533525).
3230122320123 is a wasteful number, since it uses less digits than its factorization.
3230122320123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4189523373.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 3230122320123 its reverse (3210232210323), we get a palindrome (6440354530446).
The spelling of 3230122320123 in words is "three trillion, two hundred thirty billion, one hundred twenty-two million, three hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •