Base | Representation |
---|---|
bin | 111110011100100011… |
… | …1011000000011010011 |
3 | 110211010210222122221100 |
4 | 1330321013120003103 |
5 | 4144120132033021 |
6 | 141334455555443 |
7 | 12455115033243 |
oct | 1747107300323 |
9 | 424123878840 |
10 | 134102221011 |
11 | 51966231530 |
12 | 21ba668bb83 |
13 | c851a36945 |
14 | 66c222bb23 |
15 | 374d07b626 |
hex | 1f391d80d3 |
134102221011 has 24 divisors (see below), whose sum is σ = 211332354480. Its totient is φ = 81266472000.
The previous prime is 134102220971. The next prime is 134102221013. The reversal of 134102221011 is 110122201431.
134102221011 is a `hidden beast` number, since 1 + 341 + 0 + 222 + 101 + 1 = 666.
It is not a de Polignac number, because 134102221011 - 210 = 134102219987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (134102221013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1109661 + ... + 1224561.
It is an arithmetic number, because the mean of its divisors is an integer number (8805514770).
Almost surely, 2134102221011 is an apocalyptic number.
134102221011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
134102221011 is a deficient number, since it is larger than the sum of its proper divisors (77230133469).
134102221011 is a wasteful number, since it uses less digits than its factorization.
134102221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126707 (or 126704 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 134102221011 its reverse (110122201431), we get a palindrome (244224422442).
The spelling of 134102221011 in words is "one hundred thirty-four billion, one hundred two million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •