Base | Representation |
---|---|
bin | 1001010101111111001… |
… | …10100010110111000111 |
3 | 1010200122222102002221000 |
4 | 10222333212202313013 |
5 | 20224443241214143 |
6 | 403252411024343 |
7 | 32123503046235 |
oct | 4527746426707 |
9 | 1120588362830 |
10 | 321042132423 |
11 | 114175a06891 |
12 | 5227843b0b3 |
13 | 243743a5a3c |
14 | 117779c1955 |
15 | 853eb7ebd3 |
hex | 4abf9a2dc7 |
321042132423 has 32 divisors (see below), whose sum is σ = 504005483520. Its totient is φ = 201274208640.
The previous prime is 321042132407. The next prime is 321042132449. The reversal of 321042132423 is 324231240123.
321042132423 is a `hidden beast` number, since 3 + 2 + 104 + 2 + 132 + 423 = 666.
It is not a de Polignac number, because 321042132423 - 24 = 321042132407 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321042134423) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 280936 + ... + 849122.
It is an arithmetic number, because the mean of its divisors is an integer number (15750171360).
Almost surely, 2321042132423 is an apocalyptic number.
321042132423 is a deficient number, since it is larger than the sum of its proper divisors (182963351097).
321042132423 is a wasteful number, since it uses less digits than its factorization.
321042132423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569444 (or 569438 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 321042132423 its reverse (324231240123), we get a palindrome (645273372546).
The spelling of 321042132423 in words is "three hundred twenty-one billion, forty-two million, one hundred thirty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •