Base | Representation |
---|---|
bin | 11001001101100… |
… | …111100001000100 |
3 | 1002110221122002120 |
4 | 121031213201010 |
5 | 1331242001012 |
6 | 105550205540 |
7 | 13324304352 |
oct | 3115474104 |
9 | 1073848076 |
10 | 423000132 |
11 | 1a7855295 |
12 | b97b38b0 |
13 | 69835449 |
14 | 402707d2 |
15 | 2720858c |
hex | 19367844 |
423000132 has 48 divisors (see below), whose sum is σ = 1022767872. Its totient is φ = 135959040.
The previous prime is 423000101. The next prime is 423000133. The reversal of 423000132 is 231000324.
It is a super-3 number, since 3×4230001323 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (423000133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45957 + ... + 54387.
It is an arithmetic number, because the mean of its divisors is an integer number (21307664).
Almost surely, 2423000132 is an apocalyptic number.
It is an amenable number.
423000132 is an abundant number, since it is smaller than the sum of its proper divisors (599767740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423000132 is a wasteful number, since it uses less digits than its factorization.
423000132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8588 (or 8586 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 423000132 is about 20566.9670102327. The cubic root of 423000132 is about 750.6661530339. Note that the first 3 decimals are identical.
Adding to 423000132 its reverse (231000324), we get a palindrome (654000456).
The spelling of 423000132 in words is "four hundred twenty-three million, one hundred thirty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •