Base | Representation |
---|---|
bin | 10011001000010101… |
… | …00101110011001111 |
3 | 222111202122000201112 |
4 | 21210022211303033 |
5 | 132013212314323 |
6 | 4415043002235 |
7 | 512340143534 |
oct | 114412456317 |
9 | 28452560645 |
10 | 10270432463 |
11 | 43a0433a15 |
12 | 1ba766937b |
13 | c78a35095 |
14 | 6d603ad8b |
15 | 4019cb178 |
hex | 2642a5ccf |
10270432463 has 8 divisors (see below), whose sum is σ = 11159723520. Its totient is φ = 9416015640.
The previous prime is 10270432457. The next prime is 10270432483. The reversal of 10270432463 is 36423407201.
10270432463 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10270432463 - 26 = 10270432399 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10270432423) 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 7 ways as a sum of consecutive naturals, for example, 8717945 + ... + 8719122.
It is an arithmetic number, because the mean of its divisors is an integer number (1394965440).
Almost surely, 210270432463 is an apocalyptic number.
10270432463 is a deficient number, since it is larger than the sum of its proper divisors (889291057).
10270432463 is a wasteful number, since it uses less digits than its factorization.
10270432463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17437117.
The product of its (nonzero) digits is 24192, while the sum is 32.
Adding to 10270432463 its reverse (36423407201), we get a palindrome (46693839664).
The spelling of 10270432463 in words is "ten billion, two hundred seventy million, four hundred thirty-two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •