Base | Representation |
---|---|
bin | 1001010100000111000… |
… | …00110111010110101101 |
3 | 1010121001201110012200112 |
4 | 10222003200313112231 |
5 | 20220412201314131 |
6 | 403004355305405 |
7 | 32056512130340 |
oct | 4520340672655 |
9 | 1117051405615 |
10 | 320034010541 |
11 | 1137a8945a03 |
12 | 520368ab265 |
13 | 24243583b0b |
14 | 116bdb5c457 |
15 | 84d13e702b |
hex | 4a838375ad |
320034010541 has 8 divisors (see below), whose sum is σ = 371212157760. Its totient is φ = 270220614048.
The previous prime is 320034010523. The next prime is 320034010601. The reversal of 320034010541 is 145010430023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320034010541 - 222 = 320029816237 is a prime.
It is a super-2 number, since 2×3200340105412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320034010841) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 341187176 + ... + 341188113.
It is an arithmetic number, because the mean of its divisors is an integer number (46401519720).
Almost surely, 2320034010541 is an apocalyptic number.
It is an amenable number.
320034010541 is a deficient number, since it is larger than the sum of its proper divisors (51178147219).
320034010541 is an equidigital number, since it uses as much as digits as its factorization.
320034010541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682375363.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 320034010541 its reverse (145010430023), we get a palindrome (465044440564).
The spelling of 320034010541 in words is "three hundred twenty billion, thirty-four million, ten thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •