Base | Representation |
---|---|
bin | 111100100101011000… |
… | …1001111001111000001 |
3 | 110102211010120120001211 |
4 | 1321022301033033001 |
5 | 4112422440042241 |
6 | 135434012130121 |
7 | 12254040665431 |
oct | 1711261171701 |
9 | 412733516054 |
10 | 130103440321 |
11 | 501a40003a8 |
12 | 2126b466941 |
13 | c36545121a |
14 | 64231142c1 |
15 | 35b6e97781 |
hex | 1e4ac4f3c1 |
130103440321 has 8 divisors (see below), whose sum is σ = 131402697120. Its totient is φ = 128805727008.
The previous prime is 130103440309. The next prime is 130103440349. The reversal of 130103440321 is 123044301031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130103440321 - 211 = 130103438273 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130103440292 and 130103440301.
It is not an unprimeable number, because it can be changed into a prime (130103440351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 216076 + ... + 553981.
It is an arithmetic number, because the mean of its divisors is an integer number (16425337140).
Almost surely, 2130103440321 is an apocalyptic number.
It is an amenable number.
130103440321 is a deficient number, since it is larger than the sum of its proper divisors (1299256799).
130103440321 is a wasteful number, since it uses less digits than its factorization.
130103440321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771743.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 130103440321 its reverse (123044301031), we get a palindrome (253147741352).
The spelling of 130103440321 in words is "one hundred thirty billion, one hundred three million, four hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •