Base | Representation |
---|---|
bin | 110000000110100110100110… |
… | …1111110010000011011101000 |
3 | 2001111010212201002111012101001 |
4 | 1200031031031332100123220 |
5 | 420424344240400100204 |
6 | 4055522352204004344 |
7 | 155060261215466530 |
oct | 14015151576203350 |
9 | 2044125632435331 |
10 | 423120011331304 |
11 | 112901209753941 |
12 | 3b5575ab8306b4 |
13 | 152130799b5551 |
14 | 766b1914144c0 |
15 | 33db4c869b4a4 |
hex | 180d34df906e8 |
423120011331304 has 16 divisors (see below), whose sum is σ = 906685738567200. Its totient is φ = 181337147713392.
The previous prime is 423120011331203. The next prime is 423120011331313. The reversal of 423120011331304 is 403133110021324.
It is a Harshad number since it is a multiple of its sum of digits (28).
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 3 ways as a sum of consecutive naturals, for example, 3777857243974 + ... + 3777857244085.
It is an arithmetic number, because the mean of its divisors is an integer number (56667858660450).
Almost surely, 2423120011331304 is an apocalyptic number.
It is an amenable number.
423120011331304 is an abundant number, since it is smaller than the sum of its proper divisors (483565727235896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423120011331304 is a wasteful number, since it uses less digits than its factorization.
423120011331304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7555714488072 (or 7555714488068 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 423120011331304 its reverse (403133110021324), we get a palindrome (826253121352628).
The spelling of 423120011331304 in words is "four hundred twenty-three trillion, one hundred twenty billion, eleven million, three hundred thirty-one thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •