Base | Representation |
---|---|
bin | 11011110111000011101110… |
… | …01111110000100110110111 |
3 | 22000220220202001022201222001 |
4 | 31323201313033300212313 |
5 | 31012233032004130403 |
6 | 334144535342520131 |
7 | 15622165034526151 |
oct | 1573416717604667 |
9 | 260826661281861 |
10 | 61265414130103 |
11 | 185805750aa347 |
12 | 6a55793296047 |
13 | 28253c449cc51 |
14 | 111b3947b7ad1 |
15 | 7139c249cc1d |
hex | 37b8773f09b7 |
61265414130103 has 8 divisors (see below), whose sum is σ = 61954175474928. Its totient is φ = 60580468638144.
The previous prime is 61265414130091. The next prime is 61265414130133. The reversal of 61265414130103 is 30103141456216.
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 61265414130103 - 213 = 61265414121911 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61265414130133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 953930926 + ... + 953995147.
It is an arithmetic number, because the mean of its divisors is an integer number (7744271934366).
Almost surely, 261265414130103 is an apocalyptic number.
61265414130103 is a deficient number, since it is larger than the sum of its proper divisors (688761344825).
61265414130103 is a wasteful number, since it uses less digits than its factorization.
61265414130103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1907926433.
The product of its (nonzero) digits is 51840, while the sum is 37.
Adding to 61265414130103 its reverse (30103141456216), we get a palindrome (91368555586319).
The spelling of 61265414130103 in words is "sixty-one trillion, two hundred sixty-five billion, four hundred fourteen million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •