Base | Representation |
---|---|
bin | 1001100100100100101000… |
… | …1011011011110011110000 |
3 | 1101021002001200120200100210 |
4 | 2121021022023123303300 |
5 | 2334410434040333142 |
6 | 34214341452344120 |
7 | 2134220260221621 |
oct | 231111213336360 |
9 | 41232050520323 |
10 | 10523914386672 |
11 | 339819234a145 |
12 | 121b731775040 |
13 | 5b452992824b |
14 | 285508463a48 |
15 | 133b402a549c |
hex | 9924a2dbcf0 |
10523914386672 has 40 divisors (see below), whose sum is σ = 27188530117840. Its totient is φ = 3507745489920.
The previous prime is 10523914386637. The next prime is 10523914386691. The reversal of 10523914386672 is 27668341932501.
It is a super-2 number, since 2×105239143866722 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6307897 + ... + 7799832.
It is an arithmetic number, because the mean of its divisors is an integer number (679713252946).
It is a 1-persistent number, because it is pandigital, but 2⋅10523914386672 = 21047828773344 is not.
Almost surely, 210523914386672 is an apocalyptic number.
10523914386672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10523914386672 is an abundant number, since it is smaller than the sum of its proper divisors (16664615731168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10523914386672 is a wasteful number, since it uses less digits than its factorization.
10523914386672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14123281 (or 14123275 counting only the distinct ones).
The product of its (nonzero) digits is 13063680, while the sum is 57.
The spelling of 10523914386672 in words is "ten trillion, five hundred twenty-three billion, nine hundred fourteen million, three hundred eighty-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •