Base | Representation |
---|---|
bin | 101111110000101101111100… |
… | …0100011110010101111110100 |
3 | 2001002111022202122221210210222 |
4 | 1133201123320203302233310 |
5 | 420031104040403122122 |
6 | 4045300500203233512 |
7 | 154330045335435413 |
oct | 13741337043625764 |
9 | 2032438678853728 |
10 | 420112101223412 |
11 | 1119515a5928014 |
12 | 3b150658818898 |
13 | 1505552a457340 |
14 | 75a5769b7347a |
15 | 338812e7b6b42 |
hex | 17e16f88f2bf4 |
420112101223412 has 96 divisors (see below), whose sum is σ = 796684808908800. Its totient is φ = 192692884551552.
The previous prime is 420112101223379. The next prime is 420112101223417. The reversal of 420112101223412 is 214322101211024.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420112101223417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20486267663 + ... + 20486288169.
It is an arithmetic number, because the mean of its divisors is an integer number (8298800092800).
Almost surely, 2420112101223412 is an apocalyptic number.
It is an amenable number.
420112101223412 is a deficient number, since it is larger than the sum of its proper divisors (376572707685388).
420112101223412 is a wasteful number, since it uses less digits than its factorization.
420112101223412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24045 (or 24043 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 420112101223412 its reverse (214322101211024), we get a palindrome (634434202434436).
The spelling of 420112101223412 in words is "four hundred twenty trillion, one hundred twelve billion, one hundred one million, two hundred twenty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •