Base | Representation |
---|---|
bin | 111110010110100001… |
… | …1111101011010100001 |
3 | 110210121201110201022211 |
4 | 1330231003331122201 |
5 | 4143211344431011 |
6 | 141302433402121 |
7 | 12450111132325 |
oct | 1745503753241 |
9 | 423551421284 |
10 | 133899998881 |
11 | 51872071000 |
12 | 21b4aa09341 |
13 | c81bb8208c |
14 | 66a342b985 |
15 | 373a433b21 |
hex | 1f2d0fd6a1 |
133899998881 has 32 divisors (see below), whose sum is σ = 148350375936. Its totient is φ = 120846330000.
The previous prime is 133899998833. The next prime is 133899998957. The reversal of 133899998881 is 188899998331.
It is not a de Polignac number, because 133899998881 - 221 = 133897901729 is a prime.
It is a super-2 number, since 2×1338999988812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133899998798 and 133899998807.
It is not an unprimeable number, because it can be changed into a prime (133899990881) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 162697036 + ... + 162697858.
It is an arithmetic number, because the mean of its divisors is an integer number (4635949248).
Almost surely, 2133899998881 is an apocalyptic number.
133899998881 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
133899998881 is a deficient number, since it is larger than the sum of its proper divisors (14450377055).
133899998881 is an equidigital number, since it uses as much as digits as its factorization.
133899998881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594 (or 1572 counting only the distinct ones).
The product of its digits is 241864704, while the sum is 76.
The spelling of 133899998881 in words is "one hundred thirty-three billion, eight hundred ninety-nine million, nine hundred ninety-eight thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •