Base | Representation |
---|---|
bin | 10101000111100011101… |
… | …100011110100100000100 |
3 | 12010201212022002222101220 |
4 | 111013203230132210010 |
5 | 142234101330110213 |
6 | 3030403320120340 |
7 | 206563454014152 |
oct | 25074354364404 |
9 | 5121768088356 |
10 | 1451224066308 |
11 | 50a508174495 |
12 | 1b53100060b0 |
13 | a6b08146293 |
14 | 5034d7323d2 |
15 | 27b3a1e5e23 |
hex | 151e3b1e904 |
1451224066308 has 12 divisors (see below), whose sum is σ = 3386189488080. Its totient is φ = 483741355432.
The previous prime is 1451224066273. The next prime is 1451224066337. The reversal of 1451224066308 is 8036604221541.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 1451224066308.
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 3 ways as a sum of consecutive naturals, for example, 60467669418 + ... + 60467669441.
It is an arithmetic number, because the mean of its divisors is an integer number (282182457340).
Almost surely, 21451224066308 is an apocalyptic number.
It is an amenable number.
1451224066308 is an abundant number, since it is smaller than the sum of its proper divisors (1934965421772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451224066308 is a wasteful number, since it uses less digits than its factorization.
1451224066308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120935338866 (or 120935338864 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 42.
Adding to 1451224066308 its reverse (8036604221541), we get a palindrome (9487828287849).
The spelling of 1451224066308 in words is "one trillion, four hundred fifty-one billion, two hundred twenty-four million, sixty-six thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •