Base | Representation |
---|---|
bin | 111110100001010011… |
… | …0010011010100011011 |
3 | 110211112220100212212220 |
4 | 1331002212103110123 |
5 | 4144431344314120 |
6 | 141402342035123 |
7 | 12462056262450 |
oct | 1750246232433 |
9 | 424486325786 |
10 | 134261323035 |
11 | 51a38020204 |
12 | 2202ba18aa3 |
13 | c8789a1758 |
14 | 66d9405827 |
15 | 375c007b40 |
hex | 1f4299351b |
134261323035 has 32 divisors (see below), whose sum is σ = 245527027200. Its totient is φ = 61371452928.
The previous prime is 134261322973. The next prime is 134261323069. The reversal of 134261323035 is 530323162431.
It is not a de Polignac number, because 134261323035 - 27 = 134261322907 is a prime.
It is a super-2 number, since 2×1342613230352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134261322987 and 134261323005.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1386304 + ... + 1479986.
It is an arithmetic number, because the mean of its divisors is an integer number (7672719600).
Almost surely, 2134261323035 is an apocalyptic number.
134261323035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
134261323035 is a deficient number, since it is larger than the sum of its proper divisors (111265704165).
134261323035 is a wasteful number, since it uses less digits than its factorization.
134261323035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107347.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 134261323035 its reverse (530323162431), we get a palindrome (664584485466).
The spelling of 134261323035 in words is "one hundred thirty-four billion, two hundred sixty-one million, three hundred twenty-three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •