Base | Representation |
---|---|
bin | 11101100101100001100100… |
… | …011000011010111011111001 |
3 | 122001201112122211121022012211 |
4 | 131211201210120122323321 |
5 | 114023404340402314001 |
6 | 1140425121102535121 |
7 | 36260001535635310 |
oct | 3545414430327371 |
9 | 561645584538184 |
10 | 130122013323001 |
11 | 38508488279757 |
12 | 12716626b974a1 |
13 | 577b5b78ccb2b |
14 | 241bd20a6b277 |
15 | 1009b8b194351 |
hex | 76586461aef9 |
130122013323001 has 4 divisors (see below), whose sum is σ = 148710872369152. Its totient is φ = 111533154276852.
The previous prime is 130122013322963. The next prime is 130122013323031. The reversal of 130122013323001 is 100323310221031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 130122013323001 - 233 = 130113423388409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130122013323031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9294429523065 + ... + 9294429523078.
It is an arithmetic number, because the mean of its divisors is an integer number (37177718092288).
Almost surely, 2130122013323001 is an apocalyptic number.
It is an amenable number.
130122013323001 is a deficient number, since it is larger than the sum of its proper divisors (18588859046151).
130122013323001 is an equidigital number, since it uses as much as digits as its factorization.
130122013323001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18588859046150.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 130122013323001 its reverse (100323310221031), we get a palindrome (230445323544032).
The spelling of 130122013323001 in words is "one hundred thirty trillion, one hundred twenty-two billion, thirteen million, three hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •