Base | Representation |
---|---|
bin | 10000110101000011110111… |
… | …000001100000110000111000 |
3 | 100201001202201001121211222210 |
4 | 100311003313001200300320 |
5 | 34200130230312011433 |
6 | 421230010421415120 |
7 | 21406260133323015 |
oct | 2065036701406070 |
9 | 321052631554883 |
10 | 74015020813368 |
11 | 21646659755138 |
12 | 837473486a4a0 |
13 | 323b781757b8b |
14 | 143c4bba8670c |
15 | 885479527463 |
hex | 4350f7060c38 |
74015020813368 has 64 divisors (see below), whose sum is σ = 185295078259200. Its totient is φ = 24637340736000.
The previous prime is 74015020813367. The next prime is 74015020813379. The reversal of 74015020813368 is 86331802051047.
74015020813368 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (74015020813367) 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 15 ways as a sum of consecutive naturals, for example, 323218080 + ... + 323446992.
It is an arithmetic number, because the mean of its divisors is an integer number (2895235597800).
Almost surely, 274015020813368 is an apocalyptic number.
It is an amenable number.
74015020813368 is an abundant number, since it is smaller than the sum of its proper divisors (111280057445832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74015020813368 is a wasteful number, since it uses less digits than its factorization.
74015020813368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247612 (or 247608 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 48.
The spelling of 74015020813368 in words is "seventy-four trillion, fifteen billion, twenty million, eight hundred thirteen thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •