Base | Representation |
---|---|
bin | 1000100001101011011… |
… | …0000100100001001101 |
3 | 112000002101120220012212 |
4 | 2020122312010201031 |
5 | 4344442143114330 |
6 | 151142555040205 |
7 | 13403615152130 |
oct | 2103266044115 |
9 | 460071526185 |
10 | 146479269965 |
11 | 57137802606 |
12 | 2447b740065 |
13 | 10a75035352 |
14 | 7137d58217 |
15 | 3c2497a295 |
hex | 221ad8484d |
146479269965 has 24 divisors (see below), whose sum is σ = 213397792512. Its totient is φ = 94534513920.
The previous prime is 146479269949. The next prime is 146479269973. The reversal of 146479269965 is 569962974641.
It is not a de Polignac number, because 146479269965 - 24 = 146479269949 is a prime.
It is a super-2 number, since 2×1464792699652 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146479269895 and 146479269904.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7230581 + ... + 7250810.
It is an arithmetic number, because the mean of its divisors is an integer number (8891574688).
Almost surely, 2146479269965 is an apocalyptic number.
It is an amenable number.
146479269965 is a deficient number, since it is larger than the sum of its proper divisors (66918522547).
146479269965 is a wasteful number, since it uses less digits than its factorization.
146479269965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14481437 (or 14481420 counting only the distinct ones).
The product of its digits is 176359680, while the sum is 68.
The spelling of 146479269965 in words is "one hundred forty-six billion, four hundred seventy-nine million, two hundred sixty-nine thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •