Base | Representation |
---|---|
bin | 11100000001000010… |
… | …01111100100001010 |
3 | 1102211020111001100100 |
4 | 32000201033210022 |
5 | 221301010200132 |
6 | 10524302550230 |
7 | 1041506145423 |
oct | 160041174412 |
9 | 42736431310 |
10 | 15041100042 |
11 | 64193440a1 |
12 | 2ab9298376 |
13 | 15592094c7 |
14 | a2988264a |
15 | 5d073237c |
hex | 38084f90a |
15041100042 has 12 divisors (see below), whose sum is σ = 32589050130. Its totient is φ = 5013700008.
The previous prime is 15041100031. The next prime is 15041100101. The reversal of 15041100042 is 24000114051.
It can be written as a sum of positive squares in only one way, i.e., 14539295241 + 501804801 = 120579^2 + 22401^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 835616669 = 15041100042 / (1 + 5 + 0 + 4 + 1 + 1 + 0 + 0 + 0 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 15041099988 and 15041100024.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 417808317 + ... + 417808352.
Almost surely, 215041100042 is an apocalyptic number.
15041100042 is an abundant number, since it is smaller than the sum of its proper divisors (17547950088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15041100042 is a wasteful number, since it uses less digits than its factorization.
15041100042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835616677 (or 835616674 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 15041100042 its reverse (24000114051), we get a palindrome (39041214093).
The spelling of 15041100042 in words is "fifteen billion, forty-one million, one hundred thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •