Base | Representation |
---|---|
bin | 11101100010101011101… |
… | …10011111110011001000 |
3 | 10121001000202121022122210 |
4 | 32301111312133303020 |
5 | 113112311433144430 |
6 | 2054150404345120 |
7 | 133222644002214 |
oct | 16612566376310 |
9 | 3531022538583 |
10 | 1015052631240 |
11 | 3615328255aa |
12 | 1448830a51a0 |
13 | 749469b182b |
14 | 371b364b944 |
15 | 1b60cec52b0 |
hex | ec55d9fcc8 |
1015052631240 has 32 divisors (see below), whose sum is σ = 3045157894080. Its totient is φ = 270680701632.
The previous prime is 1015052631233. The next prime is 1015052631251. The reversal of 1015052631240 is 421362505101.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1015052631198 and 1015052631207.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4229385844 + ... + 4229386083.
It is an arithmetic number, because the mean of its divisors is an integer number (95161184190).
Almost surely, 21015052631240 is an apocalyptic number.
1015052631240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1015052631240 is an abundant number, since it is smaller than the sum of its proper divisors (2030105262840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1015052631240 is a wasteful number, since it uses less digits than its factorization.
1015052631240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8458771941 (or 8458771937 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The spelling of 1015052631240 in words is "one trillion, fifteen billion, fifty-two million, six hundred thirty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •