Base | Representation |
---|---|
bin | 11101101000011100000001… |
… | …101111111101001110111000 |
3 | 122002102200102201120110021020 |
4 | 131220130001233331032320 |
5 | 114040144402313330240 |
6 | 1141101111405542440 |
7 | 36310320102464133 |
oct | 3550340157751670 |
9 | 562380381513236 |
10 | 130322222011320 |
11 | 38585386917539 |
12 | 127493a0574a20 |
13 | 5794443228b01 |
14 | 24278b475321a |
15 | 100eea7adc0d0 |
hex | 768701bfd3b8 |
130322222011320 has 32 divisors (see below), whose sum is σ = 390966666034320. Its totient is φ = 34752592536320.
The previous prime is 130322222011291. The next prime is 130322222011327. The reversal of 130322222011320 is 23110222223031.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130322222011327) 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, 543009258261 + ... + 543009258500.
Almost surely, 2130322222011320 is an apocalyptic number.
130322222011320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130322222011320 is an abundant number, since it is smaller than the sum of its proper divisors (260644444023000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130322222011320 is a wasteful number, since it uses less digits than its factorization.
130322222011320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1086018516775 (or 1086018516771 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 130322222011320 its reverse (23110222223031), we get a palindrome (153432444234351).
The spelling of 130322222011320 in words is "one hundred thirty trillion, three hundred twenty-two billion, two hundred twenty-two million, eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •