Base | Representation |
---|---|
bin | 101101111100010011010100… |
… | …0010101111011010001011010 |
3 | 1221222211201201020220210100220 |
4 | 1123320212220111323101122 |
5 | 410431432340032432214 |
6 | 3551250254013340510 |
7 | 151056062065132245 |
oct | 13370465025732132 |
9 | 1858751636823326 |
10 | 404112002233434 |
11 | 107842a3509aa50 |
12 | 393a7743a97736 |
13 | 144647a15c01a1 |
14 | 71b11a7a4825c |
15 | 31abd31d859a9 |
hex | 16f89a857b45a |
404112002233434 has 32 divisors (see below), whose sum is σ = 881701321374720. Its totient is φ = 122457848132400.
The previous prime is 404112002233409. The next prime is 404112002233441. The reversal of 404112002233434 is 434332200211404.
It is a super-2 number, since 2×4041120022334342 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 404112002233395 and 404112002233404.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16554429 + ... + 32897919.
It is an arithmetic number, because the mean of its divisors is an integer number (27553166292960).
Almost surely, 2404112002233434 is an apocalyptic number.
404112002233434 is an abundant number, since it is smaller than the sum of its proper divisors (477589319141286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404112002233434 is a wasteful number, since it uses less digits than its factorization.
404112002233434 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16718146.
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 404112002233434 its reverse (434332200211404), we get a palindrome (838444202444838).
The spelling of 404112002233434 in words is "four hundred four trillion, one hundred twelve billion, two million, two hundred thirty-three thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •