Base | Representation |
---|---|
bin | 1011001011111101001011… |
… | …1111100000000101110010 |
3 | 1121112212112022202210111011 |
4 | 2302333102333200011302 |
5 | 3103010430443332242 |
6 | 42054320100341134 |
7 | 2406435145256353 |
oct | 262772277400562 |
9 | 47485468683434 |
10 | 12300031230322 |
11 | 3a12460a71990 |
12 | 14679b36a47aa |
13 | 6b2b70b34474 |
14 | 307478d2dd2a |
15 | 164e431ecd17 |
hex | b2fd2fe0172 |
12300031230322 has 8 divisors (see below), whose sum is σ = 20127323831472. Its totient is φ = 5590923286500.
The previous prime is 12300031230313. The next prime is 12300031230367. The reversal of 12300031230322 is 22303213000321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 559092328651 = 12300031230322 / (1 + 2 + 3 + 0 + 0 + 0 + 3 + 1 + 2 + 3 + 0 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 12300031230293 and 12300031230302.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 279546164304 + ... + 279546164347.
It is an arithmetic number, because the mean of its divisors is an integer number (2515915478934).
Almost surely, 212300031230322 is an apocalyptic number.
12300031230322 is a deficient number, since it is larger than the sum of its proper divisors (7827292601150).
12300031230322 is a wasteful number, since it uses less digits than its factorization.
12300031230322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 559092328664.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 12300031230322 its reverse (22303213000321), we get a palindrome (34603244230643).
The spelling of 12300031230322 in words is "twelve trillion, three hundred billion, thirty-one million, two hundred thirty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •