Base | Representation |
---|---|
bin | 1101000111100101011110100… |
… | …0001100100010010000100001 |
3 | 11111001112202110202002002101001 |
4 | 3101321113220030202100201 |
5 | 1431444112114431300304 |
6 | 13031201541321312001 |
7 | 365305144412513314 |
oct | 32171275014422041 |
9 | 4431482422062331 |
10 | 923134101431329 |
11 | 248158a79224377 |
12 | 876516a6935601 |
13 | 30813231543718 |
14 | 123d5d00cbc97b |
15 | 71acc83078da4 |
hex | 34795e8322421 |
923134101431329 has 64 divisors (see below), whose sum is σ = 1045467754168320. Its totient is φ = 810814409856000.
The previous prime is 923134101431323. The next prime is 923134101431351.
923134101431329 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-923134101431329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (923134101431323) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2693058309 + ... + 2693401069.
It is an arithmetic number, because the mean of its divisors is an integer number (16335433658880).
Almost surely, 2923134101431329 is an apocalyptic number.
It is an amenable number.
923134101431329 is a deficient number, since it is larger than the sum of its proper divisors (122333652736991).
923134101431329 is a wasteful number, since it uses less digits than its factorization.
923134101431329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343822.
The product of its (nonzero) digits is 419904, while the sum is 46.
It can be divided in two parts, 92313410 and 1431329, that added together give a palindrome (93744739).
The spelling of 923134101431329 in words is "nine hundred twenty-three trillion, one hundred thirty-four billion, one hundred one million, four hundred thirty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •