Base | Representation |
---|---|
bin | 1001001001000111011001… |
… | …1010000010111101101111 |
3 | 1022120222111210120200000002 |
4 | 2102101312122002331233 |
5 | 2304143411230341030 |
6 | 33213531014454515 |
7 | 2055151064205623 |
oct | 222216632027557 |
9 | 38528453520002 |
10 | 10052210012015 |
11 | 3226133544886 |
12 | 116422896443b |
13 | 57bbc4a23a62 |
14 | 26a75b185183 |
15 | 126733831245 |
hex | 92476682f6f |
10052210012015 has 8 divisors (see below), whose sum is σ = 12772219780080. Its totient is φ = 7568722832512.
The previous prime is 10052210011993. The next prime is 10052210012027. The reversal of 10052210012015 is 51021001225001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10052210012015 - 212 = 10052210007919 is a prime.
It is a super-2 number, since 2×100522100120152 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59130647045 + ... + 59130647214.
It is an arithmetic number, because the mean of its divisors is an integer number (1596527472510).
Almost surely, 210052210012015 is an apocalyptic number.
10052210012015 is a deficient number, since it is larger than the sum of its proper divisors (2720009768065).
10052210012015 is a wasteful number, since it uses less digits than its factorization.
10052210012015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118261294281.
The product of its (nonzero) digits is 200, while the sum is 20.
Adding to 10052210012015 its reverse (51021001225001), we get a palindrome (61073211237016).
The spelling of 10052210012015 in words is "ten trillion, fifty-two billion, two hundred ten million, twelve thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •