Base | Representation |
---|---|
bin | 1101101110000010111010… |
… | …0011001000010101110010 |
3 | 1222102002021002211100020020 |
4 | 3123200232203020111302 |
5 | 3434121434230322230 |
6 | 52025452431224310 |
7 | 3114556036203045 |
oct | 333405643102562 |
9 | 58362232740206 |
10 | 15084706104690 |
11 | 489642a37a782 |
12 | 1837625678096 |
13 | 855635341c11 |
14 | 3a216468ac5c |
15 | 1b25c3d84810 |
hex | db82e8c8572 |
15084706104690 has 32 divisors (see below), whose sum is σ = 37086301840896. Its totient is φ = 3924476384640.
The previous prime is 15084706104679. The next prime is 15084706104707. The reversal of 15084706104690 is 9640160748051.
It is a super-2 number, since 2×150847061046902 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6131993122 + ... + 6131995581.
It is an arithmetic number, because the mean of its divisors is an integer number (1158946932528).
Almost surely, 215084706104690 is an apocalyptic number.
15084706104690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15084706104690 is an abundant number, since it is smaller than the sum of its proper divisors (22001595736206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15084706104690 is a wasteful number, since it uses less digits than its factorization.
15084706104690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12263988754.
The product of its (nonzero) digits is 1451520, while the sum is 51.
The spelling of 15084706104690 in words is "fifteen trillion, eighty-four billion, seven hundred six million, one hundred four thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •