Base | Representation |
---|---|
bin | 101111111001000000000100… |
… | …1000110100100110000100100 |
3 | 2001020112011021202222100211001 |
4 | 1133302000021012210300210 |
5 | 420203232104022010202 |
6 | 4051531455010523044 |
7 | 154505230131010210 |
oct | 13762001106446044 |
9 | 2036464252870731 |
10 | 421250545110052 |
11 | 112250397810049 |
12 | 3b2b5217296484 |
13 | 151089a9aa6a18 |
14 | 76048c6c99940 |
15 | 33a7a6031dd87 |
hex | 17f20091a4c24 |
421250545110052 has 48 divisors (see below), whose sum is σ = 859808264555520. Its totient is φ = 176848892654112.
The previous prime is 421250545110047. The next prime is 421250545110053. The reversal of 421250545110052 is 250011545052124.
It is a junction number, because it is equal to n+sod(n) for n = 421250545109993 and 421250545110020.
It is not an unprimeable number, because it can be changed into a prime (421250545110053) 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, 450052408 + ... + 450987439.
It is an arithmetic number, because the mean of its divisors is an integer number (17912672178240).
Almost surely, 2421250545110052 is an apocalyptic number.
It is an amenable number.
421250545110052 is an abundant number, since it is smaller than the sum of its proper divisors (438557719445468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421250545110052 is a wasteful number, since it uses less digits than its factorization.
421250545110052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 901040200 (or 901040198 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 37.
The spelling of 421250545110052 in words is "four hundred twenty-one trillion, two hundred fifty billion, five hundred forty-five million, one hundred ten thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •