Base | Representation |
---|---|
bin | 10101010000111110010… |
… | …010111000010000110000 |
3 | 12011200221212202200121210 |
4 | 111100332102320100300 |
5 | 142420303002021242 |
6 | 3035154431320120 |
7 | 210402135124236 |
oct | 25207622702060 |
9 | 5150855680553 |
10 | 1461334017072 |
11 | 513825a570a6 |
12 | 1b7271980040 |
13 | a7a5984c577 |
14 | 50a2c316956 |
15 | 2802ca71d9c |
hex | 1543e4b8430 |
1461334017072 has 40 divisors (see below), whose sum is σ = 3973803031360. Its totient is φ = 461473899840.
The previous prime is 1461334017071. The next prime is 1461334017079. The reversal of 1461334017072 is 2707104331641.
It is a self number, because there is not a number n which added to its sum of digits gives 1461334017072.
It is not an unprimeable number, because it can be changed into a prime (1461334017071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 801169054 + ... + 801170877.
It is an arithmetic number, because the mean of its divisors is an integer number (99345075784).
Almost surely, 21461334017072 is an apocalyptic number.
1461334017072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1461334017072 is an abundant number, since it is smaller than the sum of its proper divisors (2512469014288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1461334017072 is a wasteful number, since it uses less digits than its factorization.
1461334017072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1602339961 (or 1602339955 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 39.
The spelling of 1461334017072 in words is "one trillion, four hundred sixty-one billion, three hundred thirty-four million, seventeen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •