Base | Representation |
---|---|
bin | 110000001111010001110101… |
… | …0011100100010100101001010 |
3 | 2001122100212022200212010000220 |
4 | 1200132203222130202211022 |
5 | 421103413134132103100 |
6 | 4102234222114010510 |
7 | 155242361254025454 |
oct | 14036435234424512 |
9 | 2048325280763026 |
10 | 424312342456650 |
11 | 11322094357599a |
12 | 3b70a6a8b76a36 |
13 | 1529b6365351ab |
14 | 76acb8122b2d4 |
15 | 340c50ee97aa0 |
hex | 181e8ea72294a |
424312342456650 has 48 divisors (see below), whose sum is σ = 1107678536104800. Its totient is φ = 107194697040960.
The previous prime is 424312342456609. The next prime is 424312342456657. The reversal of 424312342456650 is 56654243213424.
It is a super-2 number, since 2×4243123424566502 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 424312342456593 and 424312342456602.
It is not an unprimeable number, because it can be changed into a prime (424312342456657) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 74440758985 + ... + 74440764684.
It is an arithmetic number, because the mean of its divisors is an integer number (23076636168850).
Almost surely, 2424312342456650 is an apocalyptic number.
424312342456650 is an abundant number, since it is smaller than the sum of its proper divisors (683366193648150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
424312342456650 is a wasteful number, since it uses less digits than its factorization.
424312342456650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148881523703 (or 148881523698 counting only the distinct ones).
The product of its (nonzero) digits is 16588800, while the sum is 51.
The spelling of 424312342456650 in words is "four hundred twenty-four trillion, three hundred twelve billion, three hundred forty-two million, four hundred fifty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •