Base | Representation |
---|---|
bin | 10101000111011111111… |
… | …100101100000101000111 |
3 | 12010201200220211101210111 |
4 | 111013133330230011013 |
5 | 142233434232111421 |
6 | 3030353152533451 |
7 | 206562061511200 |
oct | 25073774540507 |
9 | 5121626741714 |
10 | 1451161207111 |
11 | 50a485740440 |
12 | 1b52b2b51287 |
13 | a6ac8107aa5 |
14 | 5034524c5a7 |
15 | 27b3492aee1 |
hex | 151dff2c147 |
1451161207111 has 48 divisors (see below), whose sum is σ = 1874097969408. Its totient is φ = 1110900873600.
The previous prime is 1451161207109. The next prime is 1451161207127. The reversal of 1451161207111 is 1117021611541.
It is not a de Polignac number, because 1451161207111 - 21 = 1451161207109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1451161204111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10763131 + ... + 10897123.
It is an arithmetic number, because the mean of its divisors is an integer number (39043707696).
Almost surely, 21451161207111 is an apocalyptic number.
1451161207111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1451161207111 is a deficient number, since it is larger than the sum of its proper divisors (422936762297).
1451161207111 is a wasteful number, since it uses less digits than its factorization.
1451161207111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134372 (or 134365 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 31.
Adding to 1451161207111 its reverse (1117021611541), we get a palindrome (2568182818652).
The spelling of 1451161207111 in words is "one trillion, four hundred fifty-one billion, one hundred sixty-one million, two hundred seven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •