Base | Representation |
---|---|
bin | 100111001000110001… |
… | …011110111010010011 |
3 | 11000110122220201010112 |
4 | 213020301132322103 |
5 | 1142030404324111 |
6 | 31145525151535 |
7 | 3015241426250 |
oct | 471061367223 |
9 | 130418821115 |
10 | 42023120531 |
11 | 16904a57487 |
12 | 818955b5ab |
13 | 3c692634c2 |
14 | 2069164427 |
15 | 115e414e8b |
hex | 9c8c5ee93 |
42023120531 has 16 divisors (see below), whose sum is σ = 50718334464. Its totient is φ = 34038622464.
The previous prime is 42023120507. The next prime is 42023120537. The reversal of 42023120531 is 13502132024.
It is not a de Polignac number, because 42023120531 - 214 = 42023104147 is a prime.
It is a super-2 number, since 2×420231205312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 42023120497 and 42023120506.
It is not an unprimeable number, because it can be changed into a prime (42023120537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1559006 + ... + 1585731.
It is an arithmetic number, because the mean of its divisors is an integer number (3169895904).
Almost surely, 242023120531 is an apocalyptic number.
42023120531 is a deficient number, since it is larger than the sum of its proper divisors (8695213933).
42023120531 is a wasteful number, since it uses less digits than its factorization.
42023120531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3144850.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 42023120531 its reverse (13502132024), we get a palindrome (55525252555).
The spelling of 42023120531 in words is "forty-two billion, twenty-three million, one hundred twenty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •