Base | Representation |
---|---|
bin | 111100101011101000… |
… | …1000001111011101001 |
3 | 110110100202002102111101 |
4 | 1321113101001323221 |
5 | 4113340123213113 |
6 | 135510502001401 |
7 | 12262165040233 |
oct | 1712721017351 |
9 | 413322072441 |
10 | 130313101033 |
11 | 502a1391615 |
12 | 21309716261 |
13 | c399a0b80b |
14 | 6442ccd253 |
15 | 35ca5ae2dd |
hex | 1e57441ee9 |
130313101033 has 12 divisors (see below), whose sum is σ = 131754469980. Its totient is φ = 128887013376.
The previous prime is 130313101021. The next prime is 130313101049. The reversal of 130313101033 is 330101313031.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 59473552384 + 70839548649 = 243872^2 + 266157^2 .
It is not a de Polignac number, because 130313101033 - 233 = 121723166441 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130313101033.
It is not an unprimeable number, because it can be changed into a prime (130313101013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6845833 + ... + 6864841.
It is an arithmetic number, because the mean of its divisors is an integer number (10979539165).
Almost surely, 2130313101033 is an apocalyptic number.
It is an amenable number.
130313101033 is a deficient number, since it is larger than the sum of its proper divisors (1441368947).
130313101033 is an equidigital number, since it uses as much as digits as its factorization.
130313101033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19804 (or 19695 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 130313101033 its reverse (330101313031), we get a palindrome (460414414064).
The spelling of 130313101033 in words is "one hundred thirty billion, three hundred thirteen million, one hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •