Base | Representation |
---|---|
bin | 110000111001101010… |
… | …0110111000001111111 |
3 | 101001001121111010221022 |
4 | 1201303110313001333 |
5 | 3210032100010411 |
6 | 120124235454355 |
7 | 10405226544440 |
oct | 1416324670177 |
9 | 331047433838 |
10 | 105014063231 |
11 | 40599779010 |
12 | 18428bb73bb |
13 | 9b9755346c |
14 | 5122d432c7 |
15 | 2ae951cedb |
hex | 187353707f |
105014063231 has 32 divisors (see below), whose sum is σ = 134033619456. Its totient is φ = 79889040000.
The previous prime is 105014063179. The next prime is 105014063239. The reversal of 105014063231 is 132360410501.
It is not a de Polignac number, because 105014063231 - 210 = 105014062207 is a prime.
It is a super-2 number, since 2×1050140632312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105014063231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105014063239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8672081 + ... + 8684181.
It is an arithmetic number, because the mean of its divisors is an integer number (4188550608).
Almost surely, 2105014063231 is an apocalyptic number.
105014063231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105014063231 is a deficient number, since it is larger than the sum of its proper divisors (29019556225).
105014063231 is a wasteful number, since it uses less digits than its factorization.
105014063231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14783.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 105014063231 its reverse (132360410501), we get a palindrome (237374473732).
The spelling of 105014063231 in words is "one hundred five billion, fourteen million, sixty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •