Base | Representation |
---|---|
bin | 100001010010101000111101… |
… | …001110001100001000100100 |
3 | 201012102021110222222102210220 |
4 | 201102220331032030020210 |
5 | 123142341403314004112 |
6 | 1235222443313244340 |
7 | 42561145266362625 |
oct | 4122507516141044 |
9 | 635367428872726 |
10 | 146416462250532 |
11 | 4271a966964521 |
12 | 145085a8b636b0 |
13 | 6391022b60776 |
14 | 282284777ba4c |
15 | 11dd96522198c |
hex | 852a3d38c224 |
146416462250532 has 96 divisors (see below), whose sum is σ = 351071762146560. Its totient is φ = 47475214225920.
The previous prime is 146416462250501. The next prime is 146416462250581. The reversal of 146416462250532 is 235052264614641.
It is a super-2 number, since 2×1464164622505322 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37646682 + ... + 41353422.
It is an arithmetic number, because the mean of its divisors is an integer number (3656997522360).
Almost surely, 2146416462250532 is an apocalyptic number.
146416462250532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
146416462250532 is an abundant number, since it is smaller than the sum of its proper divisors (204655299896028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146416462250532 is a wasteful number, since it uses less digits than its factorization.
146416462250532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3707333 (or 3707331 counting only the distinct ones).
The product of its (nonzero) digits is 8294400, while the sum is 51.
The spelling of 146416462250532 in words is "one hundred forty-six trillion, four hundred sixteen billion, four hundred sixty-two million, two hundred fifty thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •