Base | Representation |
---|---|
bin | 10010110000100000… |
… | …001101000010101000 |
3 | 1220222200000221202000 |
4 | 102300200031002220 |
5 | 312222110214344 |
6 | 13130325411000 |
7 | 1312054351506 |
oct | 226040150250 |
9 | 56880027660 |
10 | 20141101224 |
11 | 85a6143502 |
12 | 3aa1269a60 |
13 | 1b8c9ac29a |
14 | d90d35676 |
15 | 7cd33da69 |
hex | 4b080d0a8 |
20141101224 has 64 divisors (see below), whose sum is σ = 56323080000. Its totient is φ = 6668631360.
The previous prime is 20141101193. The next prime is 20141101231. The reversal of 20141101224 is 42210114102.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20141101197 and 20141101206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 280722 + ... + 345089.
It is an arithmetic number, because the mean of its divisors is an integer number (880048125).
Almost surely, 220141101224 is an apocalyptic number.
20141101224 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
20141101224 is an abundant number, since it is smaller than the sum of its proper divisors (36181978776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20141101224 is a wasteful number, since it uses less digits than its factorization.
20141101224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625975 (or 625965 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 20141101224 its reverse (42210114102), we get a palindrome (62351215326).
The spelling of 20141101224 in words is "twenty billion, one hundred forty-one million, one hundred one thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •