Base | Representation |
---|---|
bin | 1001010110001011011… |
… | …10111111100011100101 |
3 | 1010200221010222211222122 |
4 | 10223011232333203211 |
5 | 20230201110313110 |
6 | 403310524035325 |
7 | 32126162356112 |
oct | 4530556774345 |
9 | 1120833884878 |
10 | 321145010405 |
11 | 114218a9360a |
12 | 522a6992b45 |
13 | 2438c7b649b |
14 | 11787521909 |
15 | 8548c02255 |
hex | 4ac5bbf8e5 |
321145010405 has 16 divisors (see below), whose sum is σ = 408131570160. Its totient is φ = 241750858752.
The previous prime is 321145010401. The next prime is 321145010441. The reversal of 321145010405 is 504010541123.
It can be written as a sum of positive squares in 8 ways, for example, as 786746401 + 320358264004 = 28049^2 + 566002^2 .
It is a cyclic number.
It is not a de Polignac number, because 321145010405 - 22 = 321145010401 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321145010401) 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 15 ways as a sum of consecutive naturals, for example, 13250 + ... + 801539.
It is an arithmetic number, because the mean of its divisors is an integer number (25508223135).
Almost surely, 2321145010405 is an apocalyptic number.
It is an amenable number.
321145010405 is a deficient number, since it is larger than the sum of its proper divisors (86986559755).
321145010405 is a wasteful number, since it uses less digits than its factorization.
321145010405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 819448.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 321145010405 its reverse (504010541123), we get a palindrome (825155551528).
The spelling of 321145010405 in words is "three hundred twenty-one billion, one hundred forty-five million, ten thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •