Base | Representation |
---|---|
bin | 11101100100001011111000… |
… | …101000101000111101101110 |
3 | 122001101202012001121102022111 |
4 | 131210023320220220331232 |
5 | 114020402430344302342 |
6 | 1140314543524434234 |
7 | 36250233616554634 |
oct | 3544137050507556 |
9 | 561352161542274 |
10 | 130030011322222 |
11 | 38482466574870 |
12 | 1270082b84897a |
13 | 5772a150b290b |
14 | 24176b3d13354 |
15 | 10075a41ac217 |
hex | 7642f8a28f6e |
130030011322222 has 16 divisors (see below), whose sum is σ = 212782764039552. Its totient is φ = 59102777857720.
The previous prime is 130030011322163. The next prime is 130030011322223. The reversal of 130030011322222 is 222223110030031.
It is a super-2 number, since 2×1300300113222222 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 130030011322193 and 130030011322202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130030011322223) 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, 87886858 + ... + 89354125.
It is an arithmetic number, because the mean of its divisors is an integer number (13298922752472).
Almost surely, 2130030011322222 is an apocalyptic number.
130030011322222 is a deficient number, since it is larger than the sum of its proper divisors (82752752717330).
130030011322222 is a wasteful number, since it uses less digits than its factorization.
130030011322222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177274343.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 130030011322222 its reverse (222223110030031), we get a palindrome (352253121352253).
The spelling of 130030011322222 in words is "one hundred thirty trillion, thirty billion, eleven million, three hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •