Base | Representation |
---|---|
bin | 111100100101010100… |
… | …1001100010111011101 |
3 | 110102210222121102012102 |
4 | 1321022221030113131 |
5 | 4112421420101141 |
6 | 135433455014445 |
7 | 12254014033145 |
oct | 1711251142735 |
9 | 412728542172 |
10 | 130101331421 |
11 | 501a289aa06 |
12 | 2126a80a425 |
13 | c364b93359 |
14 | 6422b25925 |
15 | 35b6bcc99b |
hex | 1e4aa4c5dd |
130101331421 has 8 divisors (see below), whose sum is σ = 135765707904. Its totient is φ = 124437604720.
The previous prime is 130101331369. The next prime is 130101331427. The reversal of 130101331421 is 124133101031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130101331421 - 218 = 130101069277 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130101331393 and 130101331402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130101331427) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 271400 + ... + 577806.
It is an arithmetic number, because the mean of its divisors is an integer number (16970713488).
Almost surely, 2130101331421 is an apocalyptic number.
It is an amenable number.
130101331421 is a deficient number, since it is larger than the sum of its proper divisors (5664376483).
130101331421 is a wasteful number, since it uses less digits than its factorization.
130101331421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324891.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 130101331421 its reverse (124133101031), we get a palindrome (254234432452).
It can be divided in two parts, 13010 and 1331421, that added together give a palindrome (1344431).
The spelling of 130101331421 in words is "one hundred thirty billion, one hundred one million, three hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •