Base | Representation |
---|---|
bin | 11100101101100011110… |
… | …110010000011101001100 |
3 | 20222121211022012000202010 |
4 | 130231203312100131030 |
5 | 224311314140001203 |
6 | 4110225201501220 |
7 | 262356252053232 |
oct | 34554366203514 |
9 | 6877738160663 |
10 | 1973065156428 |
11 | 6a0854930193 |
12 | 27a487641810 |
13 | 1140a0217802 |
14 | 6b6d556c952 |
15 | 364cd518303 |
hex | 1cb63d9074c |
1973065156428 has 48 divisors (see below), whose sum is σ = 4873328570880. Its totient is φ = 620241808704.
The previous prime is 1973065156423. The next prime is 1973065156429. The reversal of 1973065156428 is 8246515603791.
It is a super-2 number, since 2×19730651564282 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (1973065156421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65912100 + ... + 65942027.
It is an arithmetic number, because the mean of its divisors is an integer number (101527678560).
It is a 1-persistent number, because it is pandigital, but 2⋅1973065156428 = 3946130312856 is not.
Almost surely, 21973065156428 is an apocalyptic number.
It is an amenable number.
1973065156428 is an abundant number, since it is smaller than the sum of its proper divisors (2900263414452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1973065156428 is a wasteful number, since it uses less digits than its factorization.
1973065156428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131854206 (or 131854204 counting only the distinct ones).
The product of its (nonzero) digits is 10886400, while the sum is 57.
The spelling of 1973065156428 in words is "one trillion, nine hundred seventy-three billion, sixty-five million, one hundred fifty-six thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •