Base | Representation |
---|---|
bin | 10000101101001101111111… |
… | …111111111010101000110100 |
3 | 100122011020210102202100120222 |
4 | 100231031333333322220310 |
5 | 34112313130131304411 |
6 | 420134251222113512 |
7 | 21322322365406630 |
oct | 2055157777725064 |
9 | 318136712670528 |
10 | 73476152994356 |
11 | 21459074933a72 |
12 | 82a8206b7b898 |
13 | 31cca04c95138 |
14 | 142039c7addc0 |
15 | 87643b4ed4db |
hex | 42d37fffaa34 |
73476152994356 has 12 divisors (see below), whose sum is σ = 146952305988768. Its totient is φ = 31489779854712.
The previous prime is 73476152994341. The next prime is 73476152994383. The reversal of 73476152994356 is 65349925167437.
73476152994356 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 73476152994356.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1312074160586 + ... + 1312074160641.
It is an arithmetic number, because the mean of its divisors is an integer number (12246025499064).
Almost surely, 273476152994356 is an apocalyptic number.
It is an amenable number.
73476152994356 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
73476152994356 is a wasteful number, since it uses less digits than its factorization.
73476152994356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2624148321238 (or 2624148321236 counting only the distinct ones).
The product of its digits is 1028764800, while the sum is 71.
The spelling of 73476152994356 in words is "seventy-three trillion, four hundred seventy-six billion, one hundred fifty-two million, nine hundred ninety-four thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •