Base | Representation |
---|---|
bin | 1100010000011101000… |
… | …00001110110011110111 |
3 | 1111021001200021001120000 |
4 | 12020032200032303313 |
5 | 23400003413002203 |
6 | 521250152442343 |
7 | 42266330666625 |
oct | 6101640166367 |
9 | 1437050231500 |
10 | 421150125303 |
11 | 1526772a25a6 |
12 | 697563a93b3 |
13 | 3093939709b |
14 | 16553114515 |
15 | ae4d5ec4a3 |
hex | 620e80ecf7 |
421150125303 has 80 divisors (see below), whose sum is σ = 678285189120. Its totient is φ = 259882084800.
The previous prime is 421150125281. The next prime is 421150125307. The reversal of 421150125303 is 303521051124.
421150125303 is a `hidden beast` number, since 4 + 2 + 115 + 0 + 12 + 530 + 3 = 666.
It is not a de Polignac number, because 421150125303 - 26 = 421150125239 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421150125307) 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 79 ways as a sum of consecutive naturals, for example, 5443098 + ... + 5519928.
It is an arithmetic number, because the mean of its divisors is an integer number (8478564864).
Almost surely, 2421150125303 is an apocalyptic number.
421150125303 is a deficient number, since it is larger than the sum of its proper divisors (257135063817).
421150125303 is a wasteful number, since it uses less digits than its factorization.
421150125303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76970 (or 76961 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 421150125303 its reverse (303521051124), we get a palindrome (724671176427).
The spelling of 421150125303 in words is "four hundred twenty-one billion, one hundred fifty million, one hundred twenty-five thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •