Base | Representation |
---|---|
bin | 1001010110001011100… |
… | …00010000111000110100 |
3 | 1010200221011121202221222 |
4 | 10223011300100320310 |
5 | 20230201201443130 |
6 | 403310535125512 |
7 | 32126165244260 |
oct | 4530560207064 |
9 | 1120834552858 |
10 | 321145343540 |
11 | 1142191a092a |
12 | 522a6b13898 |
13 | 2438c8a1cc8 |
14 | 117875ab0a0 |
15 | 8548c6ace5 |
hex | 4ac5c10e34 |
321145343540 has 48 divisors (see below), whose sum is σ = 772932367872. Its totient is φ = 109795040256.
The previous prime is 321145343539. The next prime is 321145343569. The reversal of 321145343540 is 45343541123.
It is a super-3 number, since 3×3211453435403 (a number of 35 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 321145343540.
It is a congruent number.
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, 3199724 + ... + 3298563.
It is an arithmetic number, because the mean of its divisors is an integer number (16102757664).
Almost surely, 2321145343540 is an apocalyptic number.
It is an amenable number.
321145343540 is an abundant number, since it is smaller than the sum of its proper divisors (451787024332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321145343540 is a wasteful number, since it uses less digits than its factorization.
321145343540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6498656 (or 6498654 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 321145343540 its reverse (45343541123), we get a palindrome (366488884663).
The spelling of 321145343540 in words is "three hundred twenty-one billion, one hundred forty-five million, three hundred forty-three thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •