Base | Representation |
---|---|
bin | 1000100000111000011… |
… | …0010110010111001001 |
3 | 111222112111012212210110 |
4 | 2020032012112113021 |
5 | 4344022422333140 |
6 | 151105435504533 |
7 | 13365410446260 |
oct | 2101606262711 |
9 | 458474185713 |
10 | 146265433545 |
11 | 5703802a0a0 |
12 | 2441bbb8149 |
13 | 10a3c94521a |
14 | 71177b35d7 |
15 | 3c10cdb380 |
hex | 220e1965c9 |
146265433545 has 128 divisors (see below), whose sum is σ = 294459494400. Its totient is φ = 60227712000.
The previous prime is 146265433543. The next prime is 146265433553. The reversal of 146265433545 is 545334562641.
It is not a de Polignac number, because 146265433545 - 21 = 146265433543 is a prime.
It is a super-2 number, since 2×1462654335452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 146265433494 and 146265433503.
It is not an unprimeable number, because it can be changed into a prime (146265433543) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 93102610 + ... + 93104180.
It is an arithmetic number, because the mean of its divisors is an integer number (2300464800).
Almost surely, 2146265433545 is an apocalyptic number.
146265433545 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
146265433545 is an abundant number, since it is smaller than the sum of its proper divisors (148194060855).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146265433545 is a wasteful number, since it uses less digits than its factorization.
146265433545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2287.
The product of its digits is 5184000, while the sum is 48.
The spelling of 146265433545 in words is "one hundred forty-six billion, two hundred sixty-five million, four hundred thirty-three thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •