Base | Representation |
---|---|
bin | 111100101011100110… |
… | …0111000000110101000 |
3 | 110110100200001002220020 |
4 | 1321113030320012220 |
5 | 4113334333342300 |
6 | 135510422400440 |
7 | 12262152553626 |
oct | 1712714700650 |
9 | 413320032806 |
10 | 130312012200 |
11 | 502a0808557 |
12 | 21309290120 |
13 | c39971a036 |
14 | 6442ac8516 |
15 | 35ca4468a0 |
hex | 1e573381a8 |
130312012200 has 48 divisors (see below), whose sum is σ = 403967239680. Its totient is φ = 34749869760.
The previous prime is 130312012153. The next prime is 130312012219. The reversal of 130312012200 is 2210213031.
It is a super-2 number, since 2×1303120122002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 130312012200.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 108592744 + ... + 108593943.
It is an arithmetic number, because the mean of its divisors is an integer number (8415984160).
Almost surely, 2130312012200 is an apocalyptic number.
130312012200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130312012200 is an abundant number, since it is smaller than the sum of its proper divisors (273655227480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130312012200 is a wasteful number, since it uses less digits than its factorization.
130312012200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 217186706 (or 217186697 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 130312012200 its reverse (2210213031), we get a palindrome (132522225231).
The spelling of 130312012200 in words is "one hundred thirty billion, three hundred twelve million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •