Base | Representation |
---|---|
bin | 111100110001010010… |
… | …1011110100100000011 |
3 | 110110211222102211101200 |
4 | 1321202211132210003 |
5 | 4114232232314223 |
6 | 135541404232243 |
7 | 12266662200312 |
oct | 1714245364403 |
9 | 413758384350 |
10 | 130503010563 |
11 | 50389602442 |
12 | 2136123b683 |
13 | c3ca172013 |
14 | 6460206279 |
15 | 35dc0c3a43 |
hex | 1e6295e903 |
130503010563 has 24 divisors (see below), whose sum is σ = 189547328880. Its totient is φ = 86521704000.
The previous prime is 130503010559. The next prime is 130503010567. The reversal of 130503010563 is 365010305031.
130503010563 is a `hidden beast` number, since 1 + 305 + 0 + 301 + 0 + 56 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (130503010559) and next prime (130503010567).
It is not a de Polignac number, because 130503010563 - 22 = 130503010559 is a prime.
It is a super-4 number, since 4×1305030105634 (a number of 46 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (130503010567) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1430893 + ... + 1519361.
It is an arithmetic number, because the mean of its divisors is an integer number (7897805370).
Almost surely, 2130503010563 is an apocalyptic number.
130503010563 is a deficient number, since it is larger than the sum of its proper divisors (59044318317).
130503010563 is a wasteful number, since it uses less digits than its factorization.
130503010563 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89379 (or 89376 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 27.
Adding to 130503010563 its reverse (365010305031), we get a palindrome (495513315594).
The spelling of 130503010563 in words is "one hundred thirty billion, five hundred three million, ten thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •