Base | Representation |
---|---|
bin | 1100010000001110000… |
… | …11011101100011111001 |
3 | 1111020201222002022010001 |
4 | 12020013003131203321 |
5 | 23344224414034113 |
6 | 521225525553001 |
7 | 42263252445055 |
oct | 6100703354371 |
9 | 1436658068101 |
10 | 421025143033 |
11 | 152612798570 |
12 | 69720575761 |
13 | 30919517491 |
14 | 1654069cc65 |
15 | ae426607dd |
hex | 62070dd8f9 |
421025143033 has 8 divisors (see below), whose sum is σ = 459767411136. Its totient is φ = 382360750800.
The previous prime is 421025142997. The next prime is 421025143061. The reversal of 421025143033 is 330341520124.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-421025143033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 421025142992 and 421025143010.
It is not an unprimeable number, because it can be changed into a prime (421025143093) 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 7 ways as a sum of consecutive naturals, for example, 19457658 + ... + 19479283.
It is an arithmetic number, because the mean of its divisors is an integer number (57470926392).
Almost surely, 2421025143033 is an apocalyptic number.
It is an amenable number.
421025143033 is a deficient number, since it is larger than the sum of its proper divisors (38742268103).
421025143033 is a wasteful number, since it uses less digits than its factorization.
421025143033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38937935.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 421025143033 its reverse (330341520124), we get a palindrome (751366663157).
The spelling of 421025143033 in words is "four hundred twenty-one billion, twenty-five million, one hundred forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •