Base | Representation |
---|---|
bin | 10010111111100000000… |
… | …110111110011000010000 |
3 | 11121202210002210021011012 |
4 | 102333200012332120100 |
5 | 132340404030443230 |
6 | 2435323140510052 |
7 | 163202314406024 |
oct | 22774006763020 |
9 | 4552702707135 |
10 | 1305135015440 |
11 | 463560767303 |
12 | 190b3b0ab328 |
13 | 960c5c09609 |
14 | 47251554384 |
15 | 23e39b4b395 |
hex | 12fe01be610 |
1305135015440 has 40 divisors (see below), whose sum is σ = 3036304265280. Its totient is φ = 521733085056.
The previous prime is 1305135015413. The next prime is 1305135015511. The reversal of 1305135015440 is 445105315031.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 1305135015397 and 1305135015406.
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 7 ways as a sum of consecutive naturals, for example, 4883420 + ... + 5143739.
It is an arithmetic number, because the mean of its divisors is an integer number (75907606632).
Almost surely, 21305135015440 is an apocalyptic number.
1305135015440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1305135015440 is an abundant number, since it is smaller than the sum of its proper divisors (1731169249840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1305135015440 is a wasteful number, since it uses less digits than its factorization.
1305135015440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10028799 (or 10028793 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 1305135015440 in words is "one trillion, three hundred five billion, one hundred thirty-five million, fifteen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •