Base | Representation |
---|---|
bin | 1101101111100101000011… |
… | …01010010101001100111011 |
3 | 10222000012112021000122022122 |
4 | 12313302201222111030323 |
5 | 12430124331120421243 |
6 | 144135501514311455 |
7 | 6236321602316435 |
oct | 667624152251473 |
9 | 128005467018278 |
10 | 30222102123323 |
11 | 96a213783a680 |
12 | 34812b4a2858b |
13 | 13b2c167b84b6 |
14 | 766a869d3655 |
15 | 37622d800668 |
hex | 1b7ca1a9533b |
30222102123323 has 8 divisors (see below), whose sum is σ = 32971915552176. Its totient is φ = 27472680294400.
The previous prime is 30222102123247. The next prime is 30222102123347. The reversal of 30222102123323 is 32332120122203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30222102123323 - 216 = 30222102057787 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30222102123292 and 30222102123301.
It is not an unprimeable number, because it can be changed into a prime (30222102123373) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97738598 + ... + 98047323.
It is an arithmetic number, because the mean of its divisors is an integer number (4121489444022).
Almost surely, 230222102123323 is an apocalyptic number.
30222102123323 is a deficient number, since it is larger than the sum of its proper divisors (2749813428853).
30222102123323 is a wasteful number, since it uses less digits than its factorization.
30222102123323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195799965.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 30222102123323 its reverse (32332120122203), we get a palindrome (62554222245526).
The spelling of 30222102123323 in words is "thirty trillion, two hundred twenty-two billion, one hundred two million, one hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •