Base | Representation |
---|---|
bin | 11100000010101111… |
… | …10011110100101011 |
3 | 1102212020101210010211 |
4 | 32001113303310223 |
5 | 221313140414311 |
6 | 10525533321551 |
7 | 1042041553042 |
oct | 160127636453 |
9 | 42766353124 |
10 | 15055404331 |
11 | 6426424120 |
12 | 2b020362b7 |
13 | 155c177296 |
14 | a2b727559 |
15 | 5d1b0a821 |
hex | 3815f3d2b |
15055404331 has 16 divisors (see below), whose sum is σ = 17160675840. Its totient is φ = 13074462720.
The previous prime is 15055404307. The next prime is 15055404337. The reversal of 15055404331 is 13340455051.
It is a de Polignac number, because none of the positive numbers 2k-15055404331 is a prime.
It is a super-2 number, since 2×150554043312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15055404293 and 15055404302.
It is not an unprimeable number, because it can be changed into a prime (15055404337) 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 15 ways as a sum of consecutive naturals, for example, 155866 + ... + 233248.
It is an arithmetic number, because the mean of its divisors is an integer number (1072542240).
Almost surely, 215055404331 is an apocalyptic number.
15055404331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
15055404331 is a deficient number, since it is larger than the sum of its proper divisors (2105271509).
15055404331 is a wasteful number, since it uses less digits than its factorization.
15055404331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78186.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 15055404331 its reverse (13340455051), we get a palindrome (28395859382).
The spelling of 15055404331 in words is "fifteen billion, fifty-five million, four hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •