Base | Representation |
---|---|
bin | 11110110000011111111000… |
… | …110001010110000000010000 |
3 | 122201222002021101212000212100 |
4 | 132300133320301112000100 |
5 | 120212312444140003042 |
6 | 1155412032320400400 |
7 | 40331144001553020 |
oct | 3660377061260020 |
9 | 581862241760770 |
10 | 135274168672272 |
11 | 3a1144a8697153 |
12 | 13209059476100 |
13 | 5a633b7940536 |
14 | 255943a13ba80 |
15 | 1098bd17e224c |
hex | 7b07f8c56010 |
135274168672272 has 120 divisors (see below), whose sum is σ = 433016394355584. Its totient is φ = 38618159703552.
The previous prime is 135274168672211. The next prime is 135274168672273. The reversal of 135274168672272 is 272276861472531.
135274168672272 is a `hidden beast` number, since 1 + 3 + 5 + 2 + 7 + 416 + 86 + 72 + 2 + 72 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (135274168672273) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53632533 + ... + 56098100.
Almost surely, 2135274168672272 is an apocalyptic number.
135274168672272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
135274168672272 is an abundant number, since it is smaller than the sum of its proper divisors (297742225683312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135274168672272 is a wasteful number, since it uses less digits than its factorization.
135274168672272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109731877 (or 109731868 counting only the distinct ones).
The product of its digits is 94832640, while the sum is 63.
The spelling of 135274168672272 in words is "one hundred thirty-five trillion, two hundred seventy-four billion, one hundred sixty-eight million, six hundred seventy-two thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •