Base | Representation |
---|---|
bin | 1001010010111010011100… |
… | …1000011110011011001001 |
3 | 1100012001222101121200020001 |
4 | 2110232213020132123021 |
5 | 2314423121442322100 |
6 | 33423125222203001 |
7 | 2103260201625166 |
oct | 224564710363311 |
9 | 40161871550201 |
10 | 10220531214025 |
11 | 32905594701a0 |
12 | 1190983283461 |
13 | 591a3ac15b42 |
14 | 274967c9506d |
15 | 12acd5ab4d6a |
hex | 94ba721e6c9 |
10220531214025 has 96 divisors (see below), whose sum is σ = 14615064576000. Its totient is φ = 7012046880000.
The previous prime is 10220531214011. The next prime is 10220531214037. The reversal of 10220531214025 is 52041213502201.
It is a happy number.
10220531214025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10220531214025 - 29 = 10220531213513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10220531213984 and 10220531214002.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1478875320 + ... + 1478882230.
It is an arithmetic number, because the mean of its divisors is an integer number (152240256000).
Almost surely, 210220531214025 is an apocalyptic number.
It is an amenable number.
10220531214025 is a deficient number, since it is larger than the sum of its proper divisors (4394533361975).
10220531214025 is a wasteful number, since it uses less digits than its factorization.
10220531214025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8111 (or 8106 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 10220531214025 its reverse (52041213502201), we get a palindrome (62261744716226).
The spelling of 10220531214025 in words is "ten trillion, two hundred twenty billion, five hundred thirty-one million, two hundred fourteen thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •