Base | Representation |
---|---|
bin | 11110101101101101010… |
… | …00010100101110101011 |
3 | 10201212222211111001002020 |
4 | 33112312220110232223 |
5 | 114242304214331444 |
6 | 2124451250035523 |
7 | 136150041406242 |
oct | 17266650245653 |
9 | 3655884431066 |
10 | 1055331011499 |
11 | 377621930876 |
12 | 150644278ba3 |
13 | 7869563242b |
14 | 39114ba1959 |
15 | 1c6b914a119 |
hex | f5b6a14bab |
1055331011499 has 4 divisors (see below), whose sum is σ = 1407108015336. Its totient is φ = 703554007664.
The previous prime is 1055331011489. The next prime is 1055331011533. The reversal of 1055331011499 is 9941101335501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1055331011499 - 25 = 1055331011467 is a prime.
It is a super-2 number, since 2×10553310114992 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1055331011499.
It is not an unprimeable number, because it can be changed into a prime (1055331011489) 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 3 ways as a sum of consecutive naturals, for example, 175888501914 + ... + 175888501919.
It is an arithmetic number, because the mean of its divisors is an integer number (351777003834).
Almost surely, 21055331011499 is an apocalyptic number.
1055331011499 is a deficient number, since it is larger than the sum of its proper divisors (351777003837).
1055331011499 is an equidigital number, since it uses as much as digits as its factorization.
1055331011499 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351777003836.
The product of its (nonzero) digits is 72900, while the sum is 42.
The spelling of 1055331011499 in words is "one trillion, fifty-five billion, three hundred thirty-one million, eleven thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •