Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …01111110010110101101 |
3 | 2011022122110122100121110 |
4 | 20320021311332112231 |
5 | 34443340412000023 |
6 | 1144130415222233 |
7 | 62034422456223 |
oct | 10701165762655 |
9 | 2138573570543 |
10 | 610050500013 |
11 | 2157a266aa59 |
12 | 9a294817979 |
13 | 456b1c49836 |
14 | 21752dd0b13 |
15 | 10d073a3a93 |
hex | 8e09d7e5ad |
610050500013 has 4 divisors (see below), whose sum is σ = 813400666688. Its totient is φ = 406700333340.
The previous prime is 610050500011. The next prime is 610050500041. The reversal of 610050500013 is 310005050016.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 610050500013 - 21 = 610050500011 is a prime.
It is a super-2 number, since 2×6100505000132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (610050500011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101675083333 + ... + 101675083338.
It is an arithmetic number, because the mean of its divisors is an integer number (203350166672).
Almost surely, 2610050500013 is an apocalyptic number.
It is an amenable number.
610050500013 is a deficient number, since it is larger than the sum of its proper divisors (203350166675).
610050500013 is a wasteful number, since it uses less digits than its factorization.
610050500013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203350166674.
The product of its (nonzero) digits is 450, while the sum is 21.
Adding to 610050500013 its reverse (310005050016), we get a palindrome (920055550029).
The spelling of 610050500013 in words is "six hundred ten billion, fifty million, five hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •