Base | Representation |
---|---|
bin | 11101101000011011110110… |
… | …011000100110101100001101 |
3 | 122002102122221102210100210122 |
4 | 131220123312120212230031 |
5 | 114040144010010342201 |
6 | 1141101040435114325 |
7 | 36310312266013013 |
oct | 3550336630465415 |
9 | 562378842710718 |
10 | 130322031340301 |
11 | 38585299226589 |
12 | 127493487429a5 |
13 | 5794412889b18 |
14 | 24278972bc8b3 |
15 | 100ee95ec6e1b |
hex | 7686f6626b0d |
130322031340301 has 16 divisors (see below), whose sum is σ = 131585528954880. Its totient is φ = 129064860340080.
The previous prime is 130322031340271. The next prime is 130322031340379. The reversal of 130322031340301 is 103043130223031.
It is a cyclic number.
It is not a de Polignac number, because 130322031340301 - 214 = 130322031323917 is a prime.
It is a super-3 number, since 3×1303220313403013 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130322031342301) 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, 182376356 + ... + 183089538.
It is an arithmetic number, because the mean of its divisors is an integer number (8224095559680).
Almost surely, 2130322031340301 is an apocalyptic number.
It is an amenable number.
130322031340301 is a deficient number, since it is larger than the sum of its proper divisors (1263497614579).
130322031340301 is a wasteful number, since it uses less digits than its factorization.
130322031340301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 717616.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 130322031340301 its reverse (103043130223031), we get a palindrome (233365161563332).
The spelling of 130322031340301 in words is "one hundred thirty trillion, three hundred twenty-two billion, thirty-one million, three hundred forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •