Base | Representation |
---|---|
bin | 100001001110100011000111… |
… | …011101011010100111001001 |
3 | 201011102101210021022001012010 |
4 | 201032203013131122213021 |
5 | 123123240110244000030 |
6 | 1234445345235210133 |
7 | 42531633205636653 |
oct | 4116430735324711 |
9 | 634371707261163 |
10 | 146135313656265 |
11 | 4262170290138a |
12 | 14482004a46949 |
13 | 637066877350b |
14 | 2812db61736d3 |
15 | 11d64aca496b0 |
hex | 84e8c775a9c9 |
146135313656265 has 32 divisors (see below), whose sum is σ = 233897411646720. Its totient is φ = 77911866918144.
The previous prime is 146135313656263. The next prime is 146135313656401. The reversal of 146135313656265 is 562656313531641.
146135313656265 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 146135313656265 - 21 = 146135313656263 is a prime.
It is not an unprimeable number, because it can be changed into a prime (146135313656263) 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, 909462351 + ... + 909623019.
It is an arithmetic number, because the mean of its divisors is an integer number (7309294113960).
Almost surely, 2146135313656265 is an apocalyptic number.
146135313656265 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
146135313656265 is a deficient number, since it is larger than the sum of its proper divisors (87762097990455).
146135313656265 is a wasteful number, since it uses less digits than its factorization.
146135313656265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181281.
The product of its digits is 34992000, while the sum is 57.
The spelling of 146135313656265 in words is "one hundred forty-six trillion, one hundred thirty-five billion, three hundred thirteen million, six hundred fifty-six thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •