Base | Representation |
---|---|
bin | 1001011000000000000… |
… | …10100100010010100010 |
3 | 1010210110022200001110110 |
4 | 10230000002210102202 |
5 | 20234202021021010 |
6 | 403551550312150 |
7 | 32162341123365 |
oct | 4540002442242 |
9 | 1123408601413 |
10 | 322123220130 |
11 | 114680183aa8 |
12 | 5251a4b8656 |
13 | 244b73643ca |
14 | 1183b3da0dc |
15 | 85a4a2c120 |
hex | 4b000a44a2 |
322123220130 has 32 divisors (see below), whose sum is σ = 773295413184. Its totient is φ = 85877338176.
The previous prime is 322123220057. The next prime is 322123220137. The reversal of 322123220130 is 31022321223.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 322123220097 and 322123220106.
It is not an unprimeable number, because it can be changed into a prime (322123220137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1268452 + ... + 1501071.
It is an arithmetic number, because the mean of its divisors is an integer number (24165481662).
Almost surely, 2322123220130 is an apocalyptic number.
322123220130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
322123220130 is an abundant number, since it is smaller than the sum of its proper divisors (451172193054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
322123220130 is a wasteful number, since it uses less digits than its factorization.
322123220130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2773410.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 322123220130 its reverse (31022321223), we get a palindrome (353145541353).
The spelling of 322123220130 in words is "three hundred twenty-two billion, one hundred twenty-three million, two hundred twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •