Base | Representation |
---|---|
bin | 1000001100110010… |
… | …1100000011001101 |
3 | 12200101211120102112 |
4 | 2003030230003031 |
5 | 14001443011303 |
6 | 1002230033405 |
7 | 105355252010 |
oct | 20314540315 |
9 | 5611746375 |
10 | 2201141453 |
11 | a2a53a175 |
12 | 5151a8865 |
13 | 291041084 |
14 | 16c497377 |
15 | cd3950d8 |
hex | 8332c0cd |
2201141453 has 32 divisors (see below), whose sum is σ = 2766182400. Its totient is φ = 1708001280.
The previous prime is 2201141429. The next prime is 2201141461. The reversal of 2201141453 is 3541411022.
It is a cyclic number.
It is not a de Polignac number, because 2201141453 - 220 = 2200092877 is a prime.
It is a super-2 number, since 2×22011414532 = 9690047392229902418, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201141753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 636473 + ... + 639921.
It is an arithmetic number, because the mean of its divisors is an integer number (86443200).
Almost surely, 22201141453 is an apocalyptic number.
It is an amenable number.
2201141453 is a deficient number, since it is larger than the sum of its proper divisors (565040947).
2201141453 is a wasteful number, since it uses less digits than its factorization.
2201141453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3677.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 2201141453 is about 46916.3239501988. The cubic root of 2201141453 is about 1300.8163419016.
Adding to 2201141453 its reverse (3541411022), we get a palindrome (5742552475).
The spelling of 2201141453 in words is "two billion, two hundred one million, one hundred forty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •