Base | Representation |
---|---|
bin | 1000100001011110010… |
… | …0001110111000111001 |
3 | 111222221120002012202021 |
4 | 2020113210032320321 |
5 | 4344334102342301 |
6 | 151133312034441 |
7 | 13402346456500 |
oct | 2102744167071 |
9 | 458846065667 |
10 | 146424262201 |
11 | 57109751448 |
12 | 24465232a21 |
13 | 10a66815789 |
14 | 7130919837 |
15 | 3c1ec118a1 |
hex | 221790ee39 |
146424262201 has 24 divisors (see below), whose sum is σ = 173210316360. Its totient is φ = 123386457600.
The previous prime is 146424262189. The next prime is 146424262211. The reversal of 146424262201 is 102262424641.
It can be written as a sum of positive squares in 4 ways, for example, as 28981657600 + 117442604601 = 170240^2 + 342699^2 .
It is not a de Polignac number, because 146424262201 - 29 = 146424261689 is a prime.
It is a super-2 number, since 2×1464242622012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146424262211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6447895 + ... + 6470563.
It is an arithmetic number, because the mean of its divisors is an integer number (7217096515).
Almost surely, 2146424262201 is an apocalyptic number.
It is an amenable number.
146424262201 is a deficient number, since it is larger than the sum of its proper divisors (26786054159).
146424262201 is a wasteful number, since it uses less digits than its factorization.
146424262201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24905 (or 24898 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 34.
Adding to 146424262201 its reverse (102262424641), we get a palindrome (248686686842).
The spelling of 146424262201 in words is "one hundred forty-six billion, four hundred twenty-four million, two hundred sixty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •