Base | Representation |
---|---|
bin | 1101101001011010000000… |
… | …00111001001000101110111 |
3 | 10221020221002100020201002022 |
4 | 12310231000013021011313 |
5 | 12413141001100024343 |
6 | 143454224221303355 |
7 | 6215103035052644 |
oct | 664550007110567 |
9 | 127227070221068 |
10 | 30010012111223 |
11 | 96201a1528441 |
12 | 3448184404b5b |
13 | 1398c167aa211 |
14 | 75a6c6d82dcb |
15 | 370968c7a568 |
hex | 1b4b401c9177 |
30010012111223 has 4 divisors (see below), whose sum is σ = 30162347198280. Its totient is φ = 29857677024168.
The previous prime is 30010012111181. The next prime is 30010012111267. The reversal of 30010012111223 is 32211121001003.
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 30010012111223 - 234 = 29992832242039 is a prime.
It is a super-2 number, since 2×300100121112232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30010012911223) 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, 76167543233 + ... + 76167543626.
It is an arithmetic number, because the mean of its divisors is an integer number (7540586799570).
Almost surely, 230010012111223 is an apocalyptic number.
30010012111223 is a deficient number, since it is larger than the sum of its proper divisors (152335087057).
30010012111223 is a wasteful number, since it uses less digits than its factorization.
30010012111223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152335087056.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 30010012111223 its reverse (32211121001003), we get a palindrome (62221133112226).
The spelling of 30010012111223 in words is "thirty trillion, ten billion, twelve million, one hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •