Base | Representation |
---|---|
bin | 1001100100011011000101… |
… | …0101001111000110110110 |
3 | 1101020211102222022110211121 |
4 | 2121012301111033012312 |
5 | 2334340211102321123 |
6 | 34213235205454154 |
7 | 2134066601522323 |
oct | 231066125170666 |
9 | 41224388273747 |
10 | 10521350042038 |
11 | 3397096898060 |
12 | 121b136a1135a |
13 | 5b420b58a464 |
14 | 285343a63b4a |
15 | 133a400b975d |
hex | 991b154f1b6 |
10521350042038 has 8 divisors (see below), whose sum is σ = 17216754614280. Its totient is φ = 4782431837280.
The previous prime is 10521350042009. The next prime is 10521350042107. The reversal of 10521350042038 is 83024005312501.
10521350042038 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×105213500420382 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10521350041994 and 10521350042012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 239121591843 + ... + 239121591886.
It is an arithmetic number, because the mean of its divisors is an integer number (2152094326785).
Almost surely, 210521350042038 is an apocalyptic number.
10521350042038 is a deficient number, since it is larger than the sum of its proper divisors (6695404572242).
10521350042038 is a wasteful number, since it uses less digits than its factorization.
10521350042038 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 478243183742.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 10521350042038 its reverse (83024005312501), we get a palindrome (93545355354539).
The spelling of 10521350042038 in words is "ten trillion, five hundred twenty-one billion, three hundred fifty million, forty-two thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •