Base | Representation |
---|---|
bin | 1110101101011001000… |
… | …00101110001001010011 |
3 | 1210022112120111010111122 |
4 | 13112230200232021103 |
5 | 31240032242314103 |
6 | 1024102520232455 |
7 | 51341263202444 |
oct | 7265440561123 |
9 | 1708476433448 |
10 | 505405432403 |
11 | 185383210903 |
12 | 81b4b30b72b |
13 | 38875ca07a1 |
14 | 1a6670a12cb |
15 | d230472b38 |
hex | 75ac82e253 |
505405432403 has 4 divisors (see below), whose sum is σ = 505855482888. Its totient is φ = 504955381920.
The previous prime is 505405432381. The next prime is 505405432453. The reversal of 505405432403 is 304234504505.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 505405432403 - 210 = 505405431379 is a prime.
It is a super-2 number, since 2×5054054324032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505405432453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 225023558 + ... + 225025803.
It is an arithmetic number, because the mean of its divisors is an integer number (126463870722).
Almost surely, 2505405432403 is an apocalyptic number.
505405432403 is a deficient number, since it is larger than the sum of its proper divisors (450050485).
505405432403 is a wasteful number, since it uses less digits than its factorization.
505405432403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450050484.
The product of its (nonzero) digits is 144000, while the sum is 35.
Adding to 505405432403 its reverse (304234504505), we get a palindrome (809639936908).
The spelling of 505405432403 in words is "five hundred five billion, four hundred five million, four hundred thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •