Base | Representation |
---|---|
bin | 111110111000000100… |
… | …0110110110011000001 |
3 | 110220112011000210000222 |
4 | 1331300020312303001 |
5 | 4203012442342334 |
6 | 142010233552425 |
7 | 12520024405640 |
oct | 1756010666301 |
9 | 426464023028 |
10 | 135025355969 |
11 | 5229a325489 |
12 | 22203875715 |
13 | c96b07064a |
14 | 676ca8b357 |
15 | 37a4127d2e |
hex | 1f70236cc1 |
135025355969 has 4 divisors (see below), whose sum is σ = 154314692544. Its totient is φ = 115736019396.
The previous prime is 135025355947. The next prime is 135025355981. The reversal of 135025355969 is 969553520531.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 135025355969 - 224 = 135008578753 is a prime.
It is a super-2 number, since 2×1350253559692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 135025355969.
It is not an unprimeable number, because it can be changed into a prime (135025355989) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9644668277 + ... + 9644668290.
It is an arithmetic number, because the mean of its divisors is an integer number (38578673136).
Almost surely, 2135025355969 is an apocalyptic number.
It is an amenable number.
135025355969 is a deficient number, since it is larger than the sum of its proper divisors (19289336575).
135025355969 is an equidigital number, since it uses as much as digits as its factorization.
135025355969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19289336574.
The product of its (nonzero) digits is 5467500, while the sum is 53.
The spelling of 135025355969 in words is "one hundred thirty-five billion, twenty-five million, three hundred fifty-five thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •