Base | Representation |
---|---|
bin | 11001111110001010100110… |
… | …100101000011011100111111 |
3 | 112222102121221001202002201212 |
4 | 121332022212211003130333 |
5 | 104432413010140014101 |
6 | 1042533220515555035 |
7 | 33026231155655660 |
oct | 3176124645033477 |
9 | 488377831662655 |
10 | 114223155001151 |
11 | 3343884a230049 |
12 | 109892675bba7b |
13 | 4b97274608571 |
14 | 202c60467b367 |
15 | d3131686d1bb |
hex | 67e2a694373f |
114223155001151 has 8 divisors (see below), whose sum is σ = 130742511713280. Its totient is φ = 97754239074168.
The previous prime is 114223155001117. The next prime is 114223155001231. The reversal of 114223155001151 is 151100551322411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114223155001151 is a prime.
It is a super-2 number, since 2×1142231550011512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114223155001651) 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, 12610191431 + ... + 12610200488.
It is an arithmetic number, because the mean of its divisors is an integer number (16342813964160).
Almost surely, 2114223155001151 is an apocalyptic number.
114223155001151 is a deficient number, since it is larger than the sum of its proper divisors (16519356712129).
114223155001151 is an equidigital number, since it uses as much as digits as its factorization.
114223155001151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25220392573.
The product of its (nonzero) digits is 6000, while the sum is 32.
The spelling of 114223155001151 in words is "one hundred fourteen trillion, two hundred twenty-three billion, one hundred fifty-five million, one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •