Base | Representation |
---|---|
bin | 1100111100000110000111… |
… | …1000111111000000101100 |
3 | 1212101001021101220100020122 |
4 | 3033001201320333000230 |
5 | 3331042010421344320 |
6 | 50131333050304112 |
7 | 2665556523601415 |
oct | 317014170770054 |
9 | 55331241810218 |
10 | 14226574012460 |
11 | 4595502164757 |
12 | 1719256a28038 |
13 | 7c2738913844 |
14 | 3727d998480c |
15 | 19a0ec30dd25 |
hex | cf061e3f02c |
14226574012460 has 96 divisors (see below), whose sum is σ = 30788492926464. Its totient is φ = 5518529280000.
The previous prime is 14226574012451. The next prime is 14226574012727. The reversal of 14226574012460 is 6421047562241.
It is a happy number.
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, 120811610 + ... + 120929310.
It is an arithmetic number, because the mean of its divisors is an integer number (320713467984).
Almost surely, 214226574012460 is an apocalyptic number.
14226574012460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14226574012460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15394246463232).
14226574012460 is an abundant number, since it is smaller than the sum of its proper divisors (16561918914004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14226574012460 is a wasteful number, since it uses less digits than its factorization.
14226574012460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118635 (or 118633 counting only the distinct ones).
The product of its (nonzero) digits is 645120, while the sum is 44.
The spelling of 14226574012460 in words is "fourteen trillion, two hundred twenty-six billion, five hundred seventy-four million, twelve thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •