Base | Representation |
---|---|
bin | 111110111010011110… |
… | …0000111110101001011 |
3 | 110220201202121001002102 |
4 | 1331310330013311023 |
5 | 4203144102411242 |
6 | 142022232224015 |
7 | 12522023143460 |
oct | 1756474076513 |
9 | 426652531072 |
10 | 135105903947 |
11 | 52330840363 |
12 | 2222683b00b |
13 | c981963281 |
14 | 6779657667 |
15 | 37ab238e32 |
hex | 1f74f07d4b |
135105903947 has 32 divisors (see below), whose sum is σ = 160809172992. Its totient is φ = 111104457984.
The previous prime is 135105903899. The next prime is 135105903967. The reversal of 135105903947 is 749309501531.
It is not a de Polignac number, because 135105903947 - 26 = 135105903883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135105903967) 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 31 ways as a sum of consecutive naturals, for example, 24984518 + ... + 24989924.
It is an arithmetic number, because the mean of its divisors is an integer number (5025286656).
Almost surely, 2135105903947 is an apocalyptic number.
135105903947 is a deficient number, since it is larger than the sum of its proper divisors (25703269045).
135105903947 is a wasteful number, since it uses less digits than its factorization.
135105903947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6947.
The product of its (nonzero) digits is 510300, while the sum is 47.
The spelling of 135105903947 in words is "one hundred thirty-five billion, one hundred five million, nine hundred three thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •