Base | Representation |
---|---|
bin | 1001010110001010111… |
… | …01001100101001010110 |
3 | 1010200220211012211211210 |
4 | 10223011131030221112 |
5 | 20230143412023210 |
6 | 403310240042250 |
7 | 32126104616442 |
oct | 4530535145126 |
9 | 1120824184753 |
10 | 321140345430 |
11 | 114216397763 |
12 | 522a5303386 |
13 | 2438b842048 |
14 | 11786a69822 |
15 | 85485cee20 |
hex | 4ac574ca56 |
321140345430 has 32 divisors (see below), whose sum is σ = 771386229504. Its totient is φ = 85565269856.
The previous prime is 321140345419. The next prime is 321140345459. The reversal of 321140345430 is 34543041123.
It is a super-2 number, since 2×3211403454302 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4473522 + ... + 4544741.
It is an arithmetic number, because the mean of its divisors is an integer number (24105819672).
Almost surely, 2321140345430 is an apocalyptic number.
321140345430 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
321140345430 is an abundant number, since it is smaller than the sum of its proper divisors (450245884074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321140345430 is a wasteful number, since it uses less digits than its factorization.
321140345430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9019460.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 321140345430 its reverse (34543041123), we get a palindrome (355683386553).
The spelling of 321140345430 in words is "three hundred twenty-one billion, one hundred forty million, three hundred forty-five thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •