Base | Representation |
---|---|
bin | 1010000001001010011110… |
… | …00001101101110110111110 |
3 | 2220000001211102121102122110 |
4 | 11000211033001231312332 |
5 | 10341420334024024410 |
6 | 114504312402554450 |
7 | 4432426134521232 |
oct | 500451701556676 |
9 | 86001742542573 |
10 | 22030213111230 |
11 | 7023a62a7a535 |
12 | 2579729968a26 |
13 | c3a5951081cc |
14 | 5623a758c5c2 |
15 | 2830ca536720 |
hex | 14094f06ddbe |
22030213111230 has 32 divisors (see below), whose sum is σ = 53227360548000. Its totient is φ = 5835295820672.
The previous prime is 22030213111201. The next prime is 22030213111241. The reversal of 22030213111230 is 3211131203022.
It is a super-2 number, since 2×220302131112302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22030213111197 and 22030213111206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2464225185 + ... + 2464234124.
It is an arithmetic number, because the mean of its divisors is an integer number (1663355017125).
Almost surely, 222030213111230 is an apocalyptic number.
22030213111230 is an abundant number, since it is smaller than the sum of its proper divisors (31197147436770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22030213111230 is a wasteful number, since it uses less digits than its factorization.
22030213111230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4928459468.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 22030213111230 its reverse (3211131203022), we get a palindrome (25241344314252).
The spelling of 22030213111230 in words is "twenty-two trillion, thirty billion, two hundred thirteen million, one hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •