Base | Representation |
---|---|
bin | 111110111001011000… |
… | …1110010111110110000 |
3 | 110220122020100202222020 |
4 | 1331302301302332300 |
5 | 4203110312031142 |
6 | 142014455111440 |
7 | 12521103006456 |
oct | 1756261627660 |
9 | 426566322866 |
10 | 135069642672 |
11 | 52312323768 |
12 | 22216672580 |
13 | c9772a83b3 |
14 | 67748d89d6 |
15 | 37a7e74cec |
hex | 1f72c72fb0 |
135069642672 has 160 divisors (see below), whose sum is σ = 363479235840. Its totient is φ = 43193779200.
The previous prime is 135069642667. The next prime is 135069642679. The reversal of 135069642672 is 276246960531.
It is not an unprimeable number, because it can be changed into a prime (135069642679) 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, 23689422 + ... + 23695122.
It is an arithmetic number, because the mean of its divisors is an integer number (2271745224).
Almost surely, 2135069642672 is an apocalyptic number.
135069642672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 135069642672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181739617920).
135069642672 is an abundant number, since it is smaller than the sum of its proper divisors (228409593168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135069642672 is a wasteful number, since it uses less digits than its factorization.
135069642672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5971 (or 5965 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 135069642672 in words is "one hundred thirty-five billion, sixty-nine million, six hundred forty-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •