Base | Representation |
---|---|
bin | 111100100101010111… |
… | …1111100111011110100 |
3 | 110102211002221102122121 |
4 | 1321022233330323310 |
5 | 4112422343300340 |
6 | 135434001005324 |
7 | 12254035062556 |
oct | 1711257747364 |
9 | 412732842577 |
10 | 130103103220 |
11 | 501a38a0102 |
12 | 2126b323844 |
13 | c36536395c |
14 | 64230674d6 |
15 | 35b6e2c94a |
hex | 1e4abfcef4 |
130103103220 has 24 divisors (see below), whose sum is σ = 279880336008. Its totient is φ = 50771942400.
The previous prime is 130103103217. The next prime is 130103103233. The reversal of 130103103220 is 22301301031.
It can be written as a sum of positive squares in 4 ways, for example, as 15949669264 + 114153433956 = 126292^2 + 337866^2 .
It is a junction number, because it is equal to n+sod(n) for n = 130103103194 and 130103103203.
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, 79330341 + ... + 79331980.
It is an arithmetic number, because the mean of its divisors is an integer number (11661680667).
Almost surely, 2130103103220 is an apocalyptic number.
130103103220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130103103220 is an abundant number, since it is smaller than the sum of its proper divisors (149777232788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130103103220 is a wasteful number, since it uses less digits than its factorization.
130103103220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158662371 (or 158662369 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 130103103220 its reverse (22301301031), we get a palindrome (152404404251).
The spelling of 130103103220 in words is "one hundred thirty billion, one hundred three million, one hundred three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •