Base | Representation |
---|---|
bin | 11011100010001000101… |
… | …011010001110111001000 |
3 | 20200212210012210120220010 |
4 | 123202020223101313020 |
5 | 221444434114010333 |
6 | 4005113044031520 |
7 | 253461321140013 |
oct | 33421053216710 |
9 | 6625705716803 |
10 | 1892078656968 |
11 | 66a4760914a5 |
12 | 2668453925a0 |
13 | 1095648c1806 |
14 | 6781179c37a |
15 | 3433d633563 |
hex | 1b888ad1dc8 |
1892078656968 has 32 divisors (see below), whose sum is σ = 4730294446560. Its totient is φ = 630679845120.
The previous prime is 1892078656879. The next prime is 1892078656969. The reversal of 1892078656968 is 8696568702981.
It is a super-2 number, since 2×18920786569682 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1892078656968.
It is not an unprimeable number, because it can be changed into a prime (1892078656969) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 407296 + ... + 1987472.
It is an arithmetic number, because the mean of its divisors is an integer number (147821701455).
Almost surely, 21892078656968 is an apocalyptic number.
It is an amenable number.
1892078656968 is an abundant number, since it is smaller than the sum of its proper divisors (2838215789592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1892078656968 is a wasteful number, since it uses less digits than its factorization.
1892078656968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1630077 (or 1630073 counting only the distinct ones).
The product of its (nonzero) digits is 627056640, while the sum is 75.
The spelling of 1892078656968 in words is "one trillion, eight hundred ninety-two billion, seventy-eight million, six hundred fifty-six thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •