Base | Representation |
---|---|
bin | 11101011010000001011… |
… | …10000001110001000000 |
3 | 10120121000201201210100202 |
4 | 32231000232001301000 |
5 | 113023301144402430 |
6 | 2052101153304332 |
7 | 132666505555331 |
oct | 16550056016100 |
9 | 3517021653322 |
10 | 1010403122240 |
11 | 35a567248686 |
12 | 1439a5b650a8 |
13 | 7438564b785 |
14 | 36c91d44288 |
15 | 1b439c02d45 |
hex | eb40b81c40 |
1010403122240 has 28 divisors (see below), whose sum is σ = 2406022435596. Its totient is φ = 404161248768.
The previous prime is 1010403122233. The next prime is 1010403122249. The reversal of 1010403122240 is 422213040101.
It can be written as a sum of positive squares in 2 ways, for example, as 366518846464 + 643884275776 = 605408^2 + 802424^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (1010403122249) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1578754559 + ... + 1578755198.
Almost surely, 21010403122240 is an apocalyptic number.
1010403122240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010403122240 is an abundant number, since it is smaller than the sum of its proper divisors (1395619313356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010403122240 is an equidigital number, since it uses as much as digits as its factorization.
1010403122240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3157509774 (or 3157509764 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 1010403122240 its reverse (422213040101), we get a palindrome (1432616162341).
The spelling of 1010403122240 in words is "one trillion, ten billion, four hundred three million, one hundred twenty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •