Base | Representation |
---|---|
bin | 11101100101011001010001… |
… | …000111010010111110000110 |
3 | 122001200200122122212022002010 |
4 | 131211121101013102332012 |
5 | 114023233112113212410 |
6 | 1140421044422155050 |
7 | 36256234626030345 |
oct | 3545312107227606 |
9 | 561620578768063 |
10 | 130113100132230 |
11 | 38504723a8a596 |
12 | 12714959b82a86 |
13 | 577a7c7125357 |
14 | 241b716db1b5c |
15 | 1009818913c20 |
hex | 7656511d2f86 |
130113100132230 has 16 divisors (see below), whose sum is σ = 312271440317424. Its totient is φ = 34696826701920.
The previous prime is 130113100132199. The next prime is 130113100132321. The reversal of 130113100132230 is 32231001311031.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130113100132197 and 130113100132206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2168551668841 + ... + 2168551668900.
It is an arithmetic number, because the mean of its divisors is an integer number (19516965019839).
Almost surely, 2130113100132230 is an apocalyptic number.
130113100132230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130113100132230 is an abundant number, since it is smaller than the sum of its proper divisors (182158340185194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130113100132230 is a wasteful number, since it uses less digits than its factorization.
130113100132230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4337103337751.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 130113100132230 its reverse (32231001311031), we get a palindrome (162344101443261).
The spelling of 130113100132230 in words is "one hundred thirty trillion, one hundred thirteen billion, one hundred million, one hundred thirty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •