Base | Representation |
---|---|
bin | 110010000011100010010011… |
… | …010111010111100000110001 |
3 | 1001212110200112120222022102022 |
4 | 302003202103113113200301 |
5 | 212323330101410201040 |
6 | 2100113210112001225 |
7 | 64240655104660112 |
oct | 6203422327274061 |
9 | 1055420476868368 |
10 | 220145316100145 |
11 | 64166116842217 |
12 | 20835778b30215 |
13 | 95ab7ca60a597 |
14 | 3c51139536209 |
15 | 1a6b7416dc6b5 |
hex | c838935d7831 |
220145316100145 has 16 divisors (see below), whose sum is σ = 275661205896960. Its totient is φ = 168458423162304.
The previous prime is 220145316100117. The next prime is 220145316100147. The reversal of 220145316100145 is 541001613541022.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 220145316100145 - 214 = 220145316083761 is a prime.
It is a super-2 number, since 2×2201453161001452 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (220145316100147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30387767 + ... + 36928403.
It is an arithmetic number, because the mean of its divisors is an integer number (17228825368560).
Almost surely, 2220145316100145 is an apocalyptic number.
It is an amenable number.
220145316100145 is a deficient number, since it is larger than the sum of its proper divisors (55515889796815).
220145316100145 is a wasteful number, since it uses less digits than its factorization.
220145316100145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6833344.
The product of its (nonzero) digits is 28800, while the sum is 35.
Adding to 220145316100145 its reverse (541001613541022), we get a palindrome (761146929641167).
The spelling of 220145316100145 in words is "two hundred twenty trillion, one hundred forty-five billion, three hundred sixteen million, one hundred thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •