Base | Representation |
---|---|
bin | 111100101110101000… |
… | …0000010101101001011 |
3 | 110110121202000111022222 |
4 | 1321131100002231023 |
5 | 4114041324132410 |
6 | 135524450004255 |
7 | 12264524335220 |
oct | 1713520025513 |
9 | 413552014288 |
10 | 130413505355 |
11 | 503430298a1 |
12 | 2133727668b |
13 | c3b4764363 |
14 | 6452387947 |
15 | 35d42e3955 |
hex | 1e5d402b4b |
130413505355 has 8 divisors (see below), whose sum is σ = 178852807392. Its totient is φ = 89426403648.
The previous prime is 130413505301. The next prime is 130413505363. The reversal of 130413505355 is 553505314031.
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 130413505355 - 218 = 130413243211 is a prime.
It is a super-2 number, since 2×1304135053552 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 3726100153 = 130413505355 / (1 + 3 + 0 + 4 + 1 + 3 + 5 + 0 + 5 + 3 + 5 + 5).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1863050042 + ... + 1863050111.
It is an arithmetic number, because the mean of its divisors is an integer number (22356600924).
Almost surely, 2130413505355 is an apocalyptic number.
130413505355 is a deficient number, since it is larger than the sum of its proper divisors (48439302037).
130413505355 is an equidigital number, since it uses as much as digits as its factorization.
130413505355 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3726100165.
The product of its (nonzero) digits is 67500, while the sum is 35.
Adding to 130413505355 its reverse (553505314031), we get a palindrome (683918819386).
The spelling of 130413505355 in words is "one hundred thirty billion, four hundred thirteen million, five hundred five thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •