Base | Representation |
---|---|
bin | 10011001111100110… |
… | …01010100011001001 |
3 | 222200000100112000000 |
4 | 21213303022203021 |
5 | 132124314303033 |
6 | 4425101433213 |
7 | 514010311566 |
oct | 114763124311 |
9 | 28600315000 |
10 | 10331400393 |
11 | 4421896036 |
12 | 2003b6b809 |
13 | c88560792 |
14 | 70018b86d |
15 | 407020a13 |
hex | 267cca8c9 |
10331400393 has 28 divisors (see below), whose sum is σ = 15643492548. Its totient is φ = 6819357600.
The previous prime is 10331400377. The next prime is 10331400421. The reversal of 10331400393 is 39300413301.
10331400393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10082770569 + 248629824 = 100413^2 + 15768^2 .
It is not a de Polignac number, because 10331400393 - 24 = 10331400377 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10331400323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 3471 + ... + 143787.
Almost surely, 210331400393 is an apocalyptic number.
It is an amenable number.
10331400393 is a deficient number, since it is larger than the sum of its proper divisors (5312092155).
10331400393 is an equidigital number, since it uses as much as digits as its factorization.
10331400393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140436 (or 140421 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
Adding to 10331400393 its reverse (39300413301), we get a palindrome (49631813694).
The spelling of 10331400393 in words is "ten billion, three hundred thirty-one million, four hundred thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •