Base | Representation |
---|---|
bin | 11001001100000101… |
… | …11111111001111101 |
3 | 1021220110022212022022 |
4 | 30212002333321331 |
5 | 210143421102031 |
6 | 10113521325525 |
7 | 656055330422 |
oct | 144602777175 |
9 | 37813285268 |
10 | 13523222141 |
11 | 580a562a50 |
12 | 2754a968a5 |
13 | 13768c79c0 |
14 | 924047d49 |
15 | 54235597b |
hex | 3260bfe7d |
13523222141 has 8 divisors (see below), whose sum is σ = 15887421984. Its totient is φ = 11348158320.
The previous prime is 13523222123. The next prime is 13523222171. The reversal of 13523222141 is 14122232531.
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 13523222141 - 26 = 13523222077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13523222141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13523222171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47283851 + ... + 47284136.
It is an arithmetic number, because the mean of its divisors is an integer number (1985927748).
Almost surely, 213523222141 is an apocalyptic number.
13523222141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13523222141 is a deficient number, since it is larger than the sum of its proper divisors (2364199843).
13523222141 is a wasteful number, since it uses less digits than its factorization.
13523222141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94568011.
The product of its digits is 2880, while the sum is 26.
Adding to 13523222141 its reverse (14122232531), we get a palindrome (27645454672).
The spelling of 13523222141 in words is "thirteen billion, five hundred twenty-three million, two hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •