Base | Representation |
---|---|
bin | 11000010001101001111… |
… | …101111000011101011011 |
3 | 12220110222110220201102110 |
4 | 120101221331320131123 |
5 | 204313011113444241 |
6 | 3314212210203403 |
7 | 231345113505303 |
oct | 30215175703533 |
9 | 5813873821373 |
10 | 1668225140571 |
11 | 593543668390 |
12 | 22b391283563 |
13 | c140b7437c2 |
14 | 5aa576d2603 |
15 | 2d5daea5816 |
hex | 18469f7875b |
1668225140571 has 16 divisors (see below), whose sum is σ = 2428388915328. Its totient is φ = 1010262364800.
The previous prime is 1668225140537. The next prime is 1668225140581. The reversal of 1668225140571 is 1750415228661.
It is a happy number.
It is not a de Polignac number, because 1668225140571 - 211 = 1668225138523 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1668225140571.
It is not an unprimeable number, because it can be changed into a prime (1668225140521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19536126 + ... + 19621331.
It is an arithmetic number, because the mean of its divisors is an integer number (151774307208).
Almost surely, 21668225140571 is an apocalyptic number.
1668225140571 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1668225140571 is a deficient number, since it is larger than the sum of its proper divisors (760163774757).
1668225140571 is a wasteful number, since it uses less digits than its factorization.
1668225140571 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39158762.
The product of its (nonzero) digits is 806400, while the sum is 48.
The spelling of 1668225140571 in words is "one trillion, six hundred sixty-eight billion, two hundred twenty-five million, one hundred forty thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •