Base | Representation |
---|---|
bin | 10101000010111001101… |
… | …001000110010001011110 |
3 | 12010020221210210110001110 |
4 | 111002321221012101132 |
5 | 142143331213220024 |
6 | 3024215210122450 |
7 | 206325524341566 |
oct | 25027151062136 |
9 | 5106853713043 |
10 | 1446223570014 |
11 | 508381558623 |
12 | 1b4355420426 |
13 | a64bc172832 |
14 | 4ddd7581da6 |
15 | 279461e2629 |
hex | 150b9a4645e |
1446223570014 has 8 divisors (see below), whose sum is σ = 2892447140040. Its totient is φ = 482074523336.
The previous prime is 1446223570007. The next prime is 1446223570031. The reversal of 1446223570014 is 4100753226441.
It is a sphenic number, since it is the product of 3 distinct primes.
1446223570014 is an admirable number.
It is a super-2 number, since 2×14462235700142 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
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, 120518630829 + ... + 120518630840.
It is an arithmetic number, because the mean of its divisors is an integer number (361555892505).
Almost surely, 21446223570014 is an apocalyptic number.
1446223570014 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1446223570014 is a wasteful number, since it uses less digits than its factorization.
1446223570014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241037261674.
The product of its (nonzero) digits is 161280, while the sum is 39.
Adding to 1446223570014 its reverse (4100753226441), we get a palindrome (5546976796455).
The spelling of 1446223570014 in words is "one trillion, four hundred forty-six billion, two hundred twenty-three million, five hundred seventy thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •