Base | Representation |
---|---|
bin | 10101000011000101011… |
… | …000001011100001001000 |
3 | 12010021110112021120120220 |
4 | 111003011120023201020 |
5 | 142144232114233030 |
6 | 3024250522150040 |
7 | 206333435031630 |
oct | 25030530134110 |
9 | 5107415246526 |
10 | 1446420461640 |
11 | 508472708180 |
12 | 1b43ab352320 |
13 | a6520bac05b |
14 | 500157956c0 |
15 | 27958635a10 |
hex | 150c560b848 |
1446420461640 has 128 divisors (see below), whose sum is σ = 5409988254720. Its totient is φ = 300554899200.
The previous prime is 1446420461621. The next prime is 1446420461677. The reversal of 1446420461640 is 461640246441.
It is a super-2 number, since 2×14464204616402 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 1446420461592 and 1446420461601.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 78260266 + ... + 78278745.
It is an arithmetic number, because the mean of its divisors is an integer number (42265533240).
Almost surely, 21446420461640 is an apocalyptic number.
1446420461640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1446420461640 is an abundant number, since it is smaller than the sum of its proper divisors (3963567793080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1446420461640 is a wasteful number, since it uses less digits than its factorization.
1446420461640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156539043 (or 156539039 counting only the distinct ones).
The product of its (nonzero) digits is 442368, while the sum is 42.
The spelling of 1446420461640 in words is "one trillion, four hundred forty-six billion, four hundred twenty million, four hundred sixty-one thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •