Base | Representation |
---|---|
bin | 11111000111001001011111… |
… | …110111011100100010000000 |
3 | 122221110212220002220112201220 |
4 | 133013021133313130202000 |
5 | 120413313211140030042 |
6 | 1203003051152555040 |
7 | 40551455501643006 |
oct | 3707113767344200 |
9 | 587425802815656 |
10 | 136830676486272 |
11 | 3a66462278756a |
12 | 1341a850852a80 |
13 | 5b47101152272 |
14 | 25b08d6534a76 |
15 | 10c442ea278ec |
hex | 7c725fddc880 |
136830676486272 has 64 divisors (see below), whose sum is σ = 363508096952160. Its totient is φ = 45603748628480.
The previous prime is 136830676486211. The next prime is 136830676486279. The reversal of 136830676486272 is 272684676038631.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 136830676486197 and 136830676486206.
It is not an unprimeable number, because it can be changed into a prime (136830676486279) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22592229 + ... + 28001252.
Almost surely, 2136830676486272 is an apocalyptic number.
136830676486272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136830676486272 is an abundant number, since it is smaller than the sum of its proper divisors (226677420465888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136830676486272 is an equidigital number, since it uses as much as digits as its factorization.
136830676486272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50600541 (or 50600529 counting only the distinct ones).
The product of its (nonzero) digits is 585252864, while the sum is 69.
The spelling of 136830676486272 in words is "one hundred thirty-six trillion, eight hundred thirty billion, six hundred seventy-six million, four hundred eighty-six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •