Base | Representation |
---|---|
bin | 11101101001100110101100… |
… | …110011101011001110011000 |
3 | 122002201100101120001102000112 |
4 | 131221212230303223032120 |
5 | 114043003104213121100 |
6 | 1141202011450223452 |
7 | 36316156032266264 |
oct | 3551465463531630 |
9 | 562640346042015 |
10 | 130402401301400 |
11 | 38606390a50938 |
12 | 12760a38424b88 |
13 | 579bb80546617 |
14 | 242b71d23d0a4 |
15 | 10120ebbc3b35 |
hex | 7699acceb398 |
130402401301400 has 48 divisors (see below), whose sum is σ = 316367564907600. Its totient is φ = 49893092670080.
The previous prime is 130402401301373. The next prime is 130402401301439. The reversal of 130402401301400 is 4103104204031.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14174169455 + ... + 14174178654.
It is an arithmetic number, because the mean of its divisors is an integer number (6590990935575).
Almost surely, 2130402401301400 is an apocalyptic number.
130402401301400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130402401301400 is an abundant number, since it is smaller than the sum of its proper divisors (185965163606200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130402401301400 is a wasteful number, since it uses less digits than its factorization.
130402401301400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28348348148 (or 28348348139 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 130402401301400 its reverse (4103104204031), we get a palindrome (134505505505431).
The spelling of 130402401301400 in words is "one hundred thirty trillion, four hundred two billion, four hundred one million, three hundred one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •