Base | Representation |
---|---|
bin | 100001010101100111100011… |
… | …100001100000000000101010 |
3 | 201020010211201122201121002201 |
4 | 201111213203201200000222 |
5 | 123204220021120342300 |
6 | 1235500451041050414 |
7 | 42612011634654304 |
oct | 4125474341400052 |
9 | 636124648647081 |
10 | 146621115793450 |
11 | 42799736508361 |
12 | 145401a3026a0a |
13 | 63a74092c5b1c |
14 | 282c6dd8d6974 |
15 | 11e3e41eb366a |
hex | 8559e386002a |
146621115793450 has 96 divisors (see below), whose sum is σ = 279634426470000. Its totient is φ = 57163226265600.
The previous prime is 146621115793433. The next prime is 146621115793513. The reversal of 146621115793450 is 54397511126641.
It is a happy number.
146621115793450 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 24 ways, for example, as 32973838569 + 146588141954881 = 181587^2 + 12107359^2 .
It is a junction number, because it is equal to n+sod(n) for n = 146621115793391 and 146621115793400.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10602431136 + ... + 10602444964.
Almost surely, 2146621115793450 is an apocalyptic number.
146621115793450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146621115793450 is a deficient number, since it is larger than the sum of its proper divisors (133013310676550).
146621115793450 is a wasteful number, since it uses less digits than its factorization.
146621115793450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18460 (or 18455 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 55.
The spelling of 146621115793450 in words is "one hundred forty-six trillion, six hundred twenty-one billion, one hundred fifteen million, seven hundred ninety-three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •