Base | Representation |
---|---|
bin | 1110101101111000000… |
… | …11000101101101100111 |
3 | 1210100012201222102022201 |
4 | 13112330003011231213 |
5 | 31241101010200241 |
6 | 1024144431235331 |
7 | 51350606634466 |
oct | 7267403055547 |
9 | 1710181872281 |
10 | 505666100071 |
11 | 1854a7370330 |
12 | 82002678b47 |
13 | 388b7ca9902 |
14 | 1a68d9569dd |
15 | d2482b2931 |
hex | 75bc0c5b67 |
505666100071 has 8 divisors (see below), whose sum is σ = 563372676864. Its totient is φ = 449915678520.
The previous prime is 505666100041. The next prime is 505666100077. The reversal of 505666100071 is 170001666505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 505666100071 - 215 = 505666067303 is a prime.
It is a super-2 number, since 2×5056661000712 (a number of 24 digits) contains 22 as substring.
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 505666100071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505666100077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 489038265 + ... + 489039298.
It is an arithmetic number, because the mean of its divisors is an integer number (70421584608).
Almost surely, 2505666100071 is an apocalyptic number.
505666100071 is a deficient number, since it is larger than the sum of its proper divisors (57706576793).
505666100071 is a wasteful number, since it uses less digits than its factorization.
505666100071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 978077621.
The product of its (nonzero) digits is 37800, while the sum is 37.
Adding to 505666100071 its reverse (170001666505), we get a palindrome (675667766576).
The spelling of 505666100071 in words is "five hundred five billion, six hundred sixty-six million, one hundred thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •