Base | Representation |
---|---|
bin | 10000011100100110011… |
… | …000101110000101110101 |
3 | 11000001022000002211022110 |
4 | 100130212120232011311 |
5 | 122004142411211201 |
6 | 2223114401521233 |
7 | 144440626000530 |
oct | 20344630560565 |
9 | 4001260084273 |
10 | 1130220413301 |
11 | 3a6361a5a881 |
12 | 163064643219 |
13 | 8276ba23c35 |
14 | 3c9bacc9a17 |
15 | 1e5edb176d6 |
hex | 1072662e175 |
1130220413301 has 16 divisors (see below), whose sum is σ = 1726857908864. Its totient is φ = 644108756544.
The previous prime is 1130220413293. The next prime is 1130220413303. The reversal of 1130220413301 is 1033140220311.
It is not a de Polignac number, because 1130220413301 - 23 = 1130220413293 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130220413303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72136966 + ... + 72152631.
It is an arithmetic number, because the mean of its divisors is an integer number (107928619304).
Almost surely, 21130220413301 is an apocalyptic number.
It is an amenable number.
1130220413301 is a deficient number, since it is larger than the sum of its proper divisors (596637495563).
1130220413301 is a wasteful number, since it uses less digits than its factorization.
1130220413301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144289980.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1130220413301 its reverse (1033140220311), we get a palindrome (2163360633612).
The spelling of 1130220413301 in words is "one trillion, one hundred thirty billion, two hundred twenty million, four hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •