Base | Representation |
---|---|
bin | 1100001110100111100… |
… | …10010100101001001110 |
3 | 1111011112000121010012211 |
4 | 12013103302110221032 |
5 | 23340444220341141 |
6 | 521004322221034 |
7 | 42233036450413 |
oct | 6072362245116 |
9 | 1434460533184 |
10 | 420165012046 |
11 | 15221121740a |
12 | 695204b477a |
13 | 3081026cb30 |
14 | 1649c36010a |
15 | ade1dabd81 |
hex | 61d3c94a4e |
420165012046 has 32 divisors (see below), whose sum is σ = 731084433408. Its totient is φ = 179507322720.
The previous prime is 420165012013. The next prime is 420165012049. The reversal of 420165012046 is 640210561024.
It is a happy number.
It is a super-2 number, since 2×4201650120462 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 420165011999 and 420165012017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420165012049) 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, 11313996 + ... + 11351071.
It is an arithmetic number, because the mean of its divisors is an integer number (22846388544).
Almost surely, 2420165012046 is an apocalyptic number.
420165012046 is a gapful number since it is divisible by the number (46) formed by its first and last digit.
420165012046 is a deficient number, since it is larger than the sum of its proper divisors (310919421362).
420165012046 is a wasteful number, since it uses less digits than its factorization.
420165012046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22665136.
The product of its (nonzero) digits is 11520, while the sum is 31.
The spelling of 420165012046 in words is "four hundred twenty billion, one hundred sixty-five million, twelve thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •