Base | Representation |
---|---|
bin | 111100010001000000100101… |
… | …1000100110110101011000110 |
3 | 2120111221101021122021212200210 |
4 | 1320202001023010312223012 |
5 | 1023440203031043331342 |
6 | 5115234032345020250 |
7 | 216441462011430030 |
oct | 17042011304665306 |
9 | 2514841248255623 |
10 | 530103303105222 |
11 | 1439a8603924850 |
12 | 4b5556a3784686 |
13 | 199a36b0a411b2 |
14 | 94c91cb410c50 |
15 | 414430b8c979c |
hex | 1e2204b136ac6 |
530103303105222 has 64 divisors (see below), whose sum is σ = 1326039083288064. Its totient is φ = 137249268099840.
The previous prime is 530103303105163. The next prime is 530103303105227. The reversal of 530103303105222 is 222501303301035.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 530103303105222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530103303105227) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1832778313 + ... + 1833067524.
It is an arithmetic number, because the mean of its divisors is an integer number (20719360676376).
Almost surely, 2530103303105222 is an apocalyptic number.
530103303105222 is an abundant number, since it is smaller than the sum of its proper divisors (795935780182842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530103303105222 is a wasteful number, since it uses less digits than its factorization.
530103303105222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3665846173.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 530103303105222 its reverse (222501303301035), we get a palindrome (752604606406257).
The spelling of 530103303105222 in words is "five hundred thirty trillion, one hundred three billion, three hundred three million, one hundred five thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •