Base | Representation |
---|---|
bin | 1101101001011111100111… |
… | …00001011000100111011111 |
3 | 10221021012212010002121012211 |
4 | 12310233303201120213133 |
5 | 12413213132130042343 |
6 | 143455443024141251 |
7 | 6215240444461033 |
oct | 664576341304737 |
9 | 127235763077184 |
10 | 30013022112223 |
11 | 96214a65a9777 |
12 | 3448884467827 |
13 | 13992a62838b7 |
14 | 75a8d0a301c3 |
15 | 370a9314779d |
hex | 1b4bf38589df |
30013022112223 has 4 divisors (see below), whose sum is σ = 30013215008760. Its totient is φ = 30012829215688.
The previous prime is 30013022112191. The next prime is 30013022112259. The reversal of 30013022112223 is 32221122031003.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30013022112223 - 25 = 30013022112191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30013022112194 and 30013022112203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30013022112023) 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, 96214693 + ... + 96526126.
It is an arithmetic number, because the mean of its divisors is an integer number (7503303752190).
Almost surely, 230013022112223 is an apocalyptic number.
30013022112223 is a deficient number, since it is larger than the sum of its proper divisors (192896537).
30013022112223 is a wasteful number, since it uses less digits than its factorization.
30013022112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192896536.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 30013022112223 its reverse (32221122031003), we get a palindrome (62234144143226).
The spelling of 30013022112223 in words is "thirty trillion, thirteen billion, twenty-two million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •