Base | Representation |
---|---|
bin | 1001000011010010000… |
… | …1011011111001110011 |
3 | 112212101001200121111211 |
4 | 2100310201123321303 |
5 | 10021431000043211 |
6 | 155234040420551 |
7 | 14143302134140 |
oct | 2206441337163 |
9 | 485331617454 |
10 | 155500002931 |
11 | 5aa46774819 |
12 | 26178777757 |
13 | 11881b94570 |
14 | 77520093c7 |
15 | 40a189ee21 |
hex | 243485be73 |
155500002931 has 32 divisors (see below), whose sum is σ = 192516710400. Its totient is φ = 122306094720.
The previous prime is 155500002929. The next prime is 155500002941. The reversal of 155500002931 is 139200005551.
155500002931 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 155500002931 - 21 = 155500002929 is a prime.
It is a super-2 number, since 2×1555000029312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 155500002893 and 155500002902.
It is not an unprimeable number, because it can be changed into a prime (155500002941) 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 31 ways as a sum of consecutive naturals, for example, 44823865 + ... + 44827333.
It is an arithmetic number, because the mean of its divisors is an integer number (6016147200).
Almost surely, 2155500002931 is an apocalyptic number.
155500002931 is a deficient number, since it is larger than the sum of its proper divisors (37016707469).
155500002931 is a wasteful number, since it uses less digits than its factorization.
155500002931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6259.
The product of its (nonzero) digits is 6750, while the sum is 31.
The spelling of 155500002931 in words is "one hundred fifty-five billion, five hundred million, two thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •