Base | Representation |
---|---|
bin | 11101100010101010001… |
… | …11100010111111001010 |
3 | 10121000222220110000122200 |
4 | 32301111013202333022 |
5 | 113112300310323110 |
6 | 2054145244501030 |
7 | 133222434251532 |
oct | 16612507427712 |
9 | 3530886400580 |
10 | 1015040323530 |
11 | 361526889642 |
12 | 14487ab4a776 |
13 | 7494429276c |
14 | 371b1b664c2 |
15 | 1b60bd936c0 |
hex | ec551e2fca |
1015040323530 has 96 divisors (see below), whose sum is σ = 2644065247824. Its totient is φ = 270169095168.
The previous prime is 1015040323529. The next prime is 1015040323547. The reversal of 1015040323530 is 353230405101.
1015040323530 is a `hidden beast` number, since 10 + 1 + 50 + 40 + 32 + 3 + 530 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 597632586489 + 417407737041 = 773067^2 + 646071^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1015040323494 and 1015040323503.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 178293364 + ... + 178299056.
Almost surely, 21015040323530 is an apocalyptic number.
1015040323530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1015040323530 is an abundant number, since it is smaller than the sum of its proper divisors (1629024924294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1015040323530 is a wasteful number, since it uses less digits than its factorization.
1015040323530 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9080 (or 9077 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 1015040323530 its reverse (353230405101), we get a palindrome (1368270728631).
The spelling of 1015040323530 in words is "one trillion, fifteen billion, forty million, three hundred twenty-three thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •