Base | Representation |
---|---|
bin | 1010100010111001111111101… |
… | …1110110111000111100101100 |
3 | 10121022102221011001201010111212 |
4 | 2220232133323312320330230 |
5 | 1234231012111202133102 |
6 | 11150124544314333552 |
7 | 312206404663050440 |
oct | 25056377366707454 |
9 | 3538387131633455 |
10 | 742067200036652 |
11 | 1a5499a28850146 |
12 | 6b289717a2a2b8 |
13 | 25b0a837ab2689 |
14 | d13635bc0a820 |
15 | 5abcd0e068c52 |
hex | 2a2e7fbdb8f2c |
742067200036652 has 24 divisors (see below), whose sum is σ = 1484138861882880. Its totient is φ = 318027843913680.
The previous prime is 742067200036619. The next prime is 742067200036661. The reversal of 742067200036652 is 256630002760247.
It is a self number, because there is not a number n which added to its sum of digits gives 742067200036652.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30317702 + ... + 49023437.
It is an arithmetic number, because the mean of its divisors is an integer number (61839119245120).
Almost surely, 2742067200036652 is an apocalyptic number.
It is an amenable number.
742067200036652 is an abundant number, since it is smaller than the sum of its proper divisors (742071661846228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
742067200036652 is a wasteful number, since it uses less digits than its factorization.
742067200036652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79675181 (or 79675179 counting only the distinct ones).
The product of its (nonzero) digits is 5080320, while the sum is 50.
Adding to 742067200036652 its reverse (256630002760247), we get a palindrome (998697202796899).
The spelling of 742067200036652 in words is "seven hundred forty-two trillion, sixty-seven billion, two hundred million, thirty-six thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •