Base | Representation |
---|---|
bin | 101111100010001010011… |
… | …010010001111101110000 |
3 | 102120021101210221022010200 |
4 | 233202022122101331300 |
5 | 412004241301240341 |
6 | 10540335205155200 |
7 | 454665563563365 |
oct | 57421232217560 |
9 | 12507353838120 |
10 | 3266497290096 |
11 | 104a34a621177 |
12 | 44909b3bbb00 |
13 | 1a904c6bb7c1 |
14 | b415672846c |
15 | 59e80a33db6 |
hex | 2f88a691f70 |
3266497290096 has 30 divisors (see below), whose sum is σ = 9141655610880. Its totient is φ = 1088832429984.
The previous prime is 3266497290053. The next prime is 3266497290109. The reversal of 3266497290096 is 6900927946623.
3266497290096 is a `hidden beast` number, since 32 + 6 + 6 + 497 + 29 + 0 + 0 + 96 = 666.
3266497290096 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11342004336 + ... + 11342004623.
It is an arithmetic number, because the mean of its divisors is an integer number (304721853696).
Almost surely, 23266497290096 is an apocalyptic number.
3266497290096 is a gapful number since it is divisible by the number (36) formed by its first and last digit.
It is an amenable number.
3266497290096 is an abundant number, since it is smaller than the sum of its proper divisors (5875158320784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3266497290096 is a wasteful number, since it uses less digits than its factorization.
3266497290096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22684008973 (or 22684008964 counting only the distinct ones).
The product of its (nonzero) digits is 52907904, while the sum is 63.
The spelling of 3266497290096 in words is "three trillion, two hundred sixty-six billion, four hundred ninety-seven million, two hundred ninety thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •