Base | Representation |
---|---|
bin | 111100100010101000… |
… | …0111111011111000001 |
3 | 110102120200211020111110 |
4 | 1321011100333133001 |
5 | 4112230320213441 |
6 | 135420513033533 |
7 | 12251540061066 |
oct | 1710520773701 |
9 | 412520736443 |
10 | 130011101121 |
11 | 50156971610 |
12 | 212445558a9 |
13 | c34c290645 |
14 | 6414b58c6d |
15 | 35add07b16 |
hex | 1e4543f7c1 |
130011101121 has 16 divisors (see below), whose sum is σ = 191231858880. Its totient is φ = 77909272320.
The previous prime is 130011101113. The next prime is 130011101123. The reversal of 130011101121 is 121101110031.
It is not a de Polignac number, because 130011101121 - 23 = 130011101113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130011101097 and 130011101106.
It is not an unprimeable number, because it can be changed into a prime (130011101123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22130380 + ... + 22136253.
It is an arithmetic number, because the mean of its divisors is an integer number (11951991180).
Almost surely, 2130011101121 is an apocalyptic number.
130011101121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130011101121 is a deficient number, since it is larger than the sum of its proper divisors (61220757759).
130011101121 is a wasteful number, since it uses less digits than its factorization.
130011101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44266736.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 130011101121 its reverse (121101110031), we get a palindrome (251112211152).
It can be divided in two parts, 130011 and 101121, that added together give a palindrome (231132).
The spelling of 130011101121 in words is "one hundred thirty billion, eleven million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •