Base | Representation |
---|---|
bin | 11110010101001010010… |
… | …10001100111001000011 |
3 | 10200121222102201201110100 |
4 | 33022211022030321003 |
5 | 114033312132004030 |
6 | 2114431455333443 |
7 | 135202344226164 |
oct | 17124512147103 |
9 | 3617872651410 |
10 | 1042153000515 |
11 | 371a7a222100 |
12 | 149b86b21283 |
13 | 77375404cb3 |
14 | 3862493976b |
15 | 1c197284360 |
hex | f2a528ce43 |
1042153000515 has 36 divisors (see below), whose sum is σ = 1985545506672. Its totient is φ = 505286300640.
The previous prime is 1042153000489. The next prime is 1042153000549. The reversal of 1042153000515 is 5150003512401.
1042153000515 is a `hidden beast` number, since 104 + 2 + 15 + 30 + 0 + 0 + 515 = 666.
It is not a de Polignac number, because 1042153000515 - 27 = 1042153000387 is a prime.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 95692719 + ... + 95703608.
It is an arithmetic number, because the mean of its divisors is an integer number (55154041852).
Almost surely, 21042153000515 is an apocalyptic number.
1042153000515 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1042153000515 is a deficient number, since it is larger than the sum of its proper divisors (943392506157).
1042153000515 is a wasteful number, since it uses less digits than its factorization.
1042153000515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191396360 (or 191396346 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 1042153000515 its reverse (5150003512401), we get a palindrome (6192156512916).
The spelling of 1042153000515 in words is "one trillion, forty-two billion, one hundred fifty-three million, five hundred fifteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •