Base | Representation |
---|---|
bin | 10100011000111000011… |
… | …000010111100011011000 |
3 | 11221221111102201100011022 |
4 | 110120320120113203120 |
5 | 140423430421004040 |
6 | 2551354152022012 |
7 | 203140460061533 |
oct | 24307030274330 |
9 | 4857442640138 |
10 | 1401105250520 |
11 | 4a0229429378 |
12 | 1a7663391908 |
13 | a217b8a5671 |
14 | 4bb57313a1a |
15 | 266a51d16b5 |
hex | 146386178d8 |
1401105250520 has 16 divisors (see below), whose sum is σ = 3152486813760. Its totient is φ = 560442100192.
The previous prime is 1401105250499. The next prime is 1401105250541. The reversal of 1401105250520 is 250525011041.
It is an interprime number because it is at equal distance from previous prime (1401105250499) and next prime (1401105250541).
It is a self number, because there is not a number n which added to its sum of digits gives 1401105250520.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17513815592 + ... + 17513815671.
It is an arithmetic number, because the mean of its divisors is an integer number (197030425860).
Almost surely, 21401105250520 is an apocalyptic number.
1401105250520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1401105250520 is an abundant number, since it is smaller than the sum of its proper divisors (1751381563240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1401105250520 is a wasteful number, since it uses less digits than its factorization.
1401105250520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35027631274 (or 35027631270 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 26.
The spelling of 1401105250520 in words is "one trillion, four hundred one billion, one hundred five million, two hundred fifty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •