Base | Representation |
---|---|
bin | 111001011010100110111011… |
… | …1011100101000110001101001 |
3 | 2110020011210212100021200220120 |
4 | 1302311031313130220301221 |
5 | 1012143440243244234010 |
6 | 4550041322032313453 |
7 | 211243345224156411 |
oct | 16265156734506151 |
9 | 2406153770250816 |
10 | 505034323430505 |
11 | 136a129433a4720 |
12 | 487870510a2889 |
13 | 188a56bc75423b |
14 | 8c9db12513641 |
15 | 3d5c17d5a9e70 |
hex | 1cb5377728c69 |
505034323430505 has 128 divisors (see below), whose sum is σ = 945230769561600. Its totient is φ = 227532572467200.
The previous prime is 505034323430501. The next prime is 505034323430579.
505034323430505 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 505034323430505 - 22 = 505034323430501 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (505034323430501) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 5630905701 + ... + 5630995389.
It is an arithmetic number, because the mean of its divisors is an integer number (7384615387200).
Almost surely, 2505034323430505 is an apocalyptic number.
505034323430505 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
505034323430505 is a deficient number, since it is larger than the sum of its proper divisors (440196446131095).
505034323430505 is a wasteful number, since it uses less digits than its factorization.
505034323430505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115215.
The product of its (nonzero) digits is 1620000, while the sum is 42.
The spelling of 505034323430505 in words is "five hundred five trillion, thirty-four billion, three hundred twenty-three million, four hundred thirty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •