Base | Representation |
---|---|
bin | 1001001011100100100000011… |
… | …1010010100011011100111010 |
3 | 10010201102212111010210002211020 |
4 | 2102321020013102203130322 |
5 | 1134134211432314042132 |
6 | 10210002525310443310 |
7 | 253035613111050060 |
oct | 22271100722433472 |
9 | 3121385433702736 |
10 | 646040513034042 |
11 | 177937274403585 |
12 | 6055ab90803536 |
13 | 21963488883369 |
14 | b576755cd0030 |
15 | 4ea4ee28e952c |
hex | 24b92074a373a |
646040513034042 has 32 divisors (see below), whose sum is σ = 1498703791437312. Its totient is φ = 181828033518384.
The previous prime is 646040513034011. The next prime is 646040513034061. The reversal of 646040513034042 is 240430315040646.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 646040513033985 and 646040513034003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 114790422388 + ... + 114790428015.
It is an arithmetic number, because the mean of its divisors is an integer number (46834493482416).
Almost surely, 2646040513034042 is an apocalyptic number.
646040513034042 is an abundant number, since it is smaller than the sum of its proper divisors (852663278403270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
646040513034042 is a wasteful number, since it uses less digits than its factorization.
646040513034042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229580850482.
The product of its (nonzero) digits is 829440, while the sum is 42.
Adding to 646040513034042 its reverse (240430315040646), we get a palindrome (886470828074688).
The spelling of 646040513034042 in words is "six hundred forty-six trillion, forty billion, five hundred thirteen million, thirty-four thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •