Base | Representation |
---|---|
bin | 1001010100011001101101… |
… | …1011000010000001111101 |
3 | 1100021111222122101000212210 |
4 | 2111012123123002001331 |
5 | 2320333010231240040 |
6 | 33442555003451033 |
7 | 2105154010505400 |
oct | 225063333020175 |
9 | 40244878330783 |
10 | 10246104555645 |
11 | 32a03919a7272 |
12 | 119591b826a79 |
13 | 594285172c4a |
14 | 275cb2445d37 |
15 | 12b7d0c8b480 |
hex | 9519b6c207d |
10246104555645 has 384 divisors, whose sum is σ = 21314112049152. Its totient is φ = 4170468556800.
The previous prime is 10246104555587. The next prime is 10246104555653. The reversal of 10246104555645 is 54655540164201.
It is a happy number.
It is not a de Polignac number, because 10246104555645 - 26 = 10246104555581 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10246104555594 and 10246104555603.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 6918368305 + ... + 6918369785.
It is an arithmetic number, because the mean of its divisors is an integer number (55505500128).
Almost surely, 210246104555645 is an apocalyptic number.
10246104555645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10246104555645 is an abundant number, since it is smaller than the sum of its proper divisors (11068007493507).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10246104555645 is a wasteful number, since it uses less digits than its factorization.
10246104555645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1941 (or 1934 counting only the distinct ones).
The product of its (nonzero) digits is 2880000, while the sum is 48.
The spelling of 10246104555645 in words is "ten trillion, two hundred forty-six billion, one hundred four million, five hundred fifty-five thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •