Base | Representation |
---|---|
bin | 1010010010100101001111… |
… | …0101100010011111100000 |
3 | 1111001122022112101122010112 |
4 | 2210221103311202133200 |
5 | 2440333242200322004 |
6 | 40021424003350452 |
7 | 2245302102413153 |
oct | 244512365423740 |
9 | 44048275348115 |
10 | 11314350401504 |
11 | 3672430923267 |
12 | 1328969082428 |
13 | 640c283286a7 |
14 | 2b1890523c9a |
15 | 1494a3b13e6e |
hex | a4a53d627e0 |
11314350401504 has 12 divisors (see below), whose sum is σ = 22275127353024. Its totient is φ = 5657175200736.
The previous prime is 11314350401477. The next prime is 11314350401509. The reversal of 11314350401504 is 40510405341311.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 353573450047 = 11314350401504 / (1 + 1 + 3 + 1 + 4 + 3 + 5 + 0 + 4 + 0 + 1 + 5 + 0 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11314350401509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 176786724992 + ... + 176786725055.
It is an arithmetic number, because the mean of its divisors is an integer number (1856260612752).
Almost surely, 211314350401504 is an apocalyptic number.
It is an amenable number.
11314350401504 is a deficient number, since it is larger than the sum of its proper divisors (10960776951520).
11314350401504 is an equidigital number, since it uses as much as digits as its factorization.
11314350401504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353573450057 (or 353573450049 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 11314350401504 its reverse (40510405341311), we get a palindrome (51824755742815).
The spelling of 11314350401504 in words is "eleven trillion, three hundred fourteen billion, three hundred fifty million, four hundred one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •