Base | Representation |
---|---|
bin | 101101101111010010111001… |
… | …1000100010001111011000010 |
3 | 1221202111211121022202001100210 |
4 | 1123132211303010101323002 |
5 | 410213140333404120114 |
6 | 3543401140113054550 |
7 | 150512656511050434 |
oct | 13336456304217302 |
9 | 1852454538661323 |
10 | 402324402020034 |
11 | 10721390340158a |
12 | 391591b8257456 |
13 | 1436504a2a7c20 |
14 | 714c868004654 |
15 | 317a5aac1d259 |
hex | 16de973111ec2 |
402324402020034 has 64 divisors (see below), whose sum is σ = 867540108718080. Its totient is φ = 123649970368320.
The previous prime is 402324402020033. The next prime is 402324402020081. The reversal of 402324402020034 is 430020204423204.
It is a super-2 number, since 2×4023244020200342 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 402324402019983 and 402324402020010.
It is not an unprimeable number, because it can be changed into a prime (402324402020033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 816637839 + ... + 817130349.
It is an arithmetic number, because the mean of its divisors is an integer number (13555314198720).
Almost surely, 2402324402020034 is an apocalyptic number.
402324402020034 is an abundant number, since it is smaller than the sum of its proper divisors (465215706698046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402324402020034 is a wasteful number, since it uses less digits than its factorization.
402324402020034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504535.
The product of its (nonzero) digits is 36864, while the sum is 30.
Adding to 402324402020034 its reverse (430020204423204), we get a palindrome (832344606443238).
The spelling of 402324402020034 in words is "four hundred two trillion, three hundred twenty-four billion, four hundred two million, twenty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •