Base | Representation |
---|---|
bin | 111100100101111000… |
… | …1100110100100001100 |
3 | 110102212022022210011120 |
4 | 1321023301212210030 |
5 | 4112441300004400 |
6 | 135435413520540 |
7 | 12254334261261 |
oct | 1711361464414 |
9 | 412768283146 |
10 | 130120313100 |
11 | 50202585148 |
12 | 21275043150 |
13 | c368aab10b |
14 | 6425467268 |
15 | 35b86cbca0 |
hex | 1e4bc6690c |
130120313100 has 72 divisors (see below), whose sum is σ = 384491724288. Its totient is φ = 33960475200.
The previous prime is 130120313083. The next prime is 130120313101. The reversal of 130120313100 is 1313021031.
It is a super-2 number, since 2×1301203131002 (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 130120313100.
It is not an unprimeable number, because it can be changed into a prime (130120313101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4600096 + ... + 4628295.
Almost surely, 2130120313100 is an apocalyptic number.
130120313100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130120313100 is an abundant number, since it is smaller than the sum of its proper divisors (254371411188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130120313100 is a wasteful number, since it uses less digits than its factorization.
130120313100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9228455 (or 9228448 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 130120313100 its reverse (1313021031), we get a palindrome (131433334131).
The spelling of 130120313100 in words is "one hundred thirty billion, one hundred twenty million, three hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •