Base | Representation |
---|---|
bin | 10010110110110010… |
… | …00011111101110111 |
3 | 222010111122102102000 |
4 | 21123121003331313 |
5 | 131213021343340 |
6 | 4352303550343 |
7 | 505602021165 |
oct | 113331037567 |
9 | 28114572360 |
10 | 10123231095 |
11 | 432533339a |
12 | 1b662bb3b3 |
13 | c543a5c93 |
14 | 6c0680235 |
15 | 3e3b00d30 |
hex | 25b643f77 |
10123231095 has 16 divisors (see below), whose sum is σ = 17996855520. Its totient is φ = 5399056512.
The previous prime is 10123231093. The next prime is 10123231121. The reversal of 10123231095 is 59013232101.
10123231095 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10123231095 - 21 = 10123231093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10123231093) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37493314 + ... + 37493583.
It is an arithmetic number, because the mean of its divisors is an integer number (1124803470).
Almost surely, 210123231095 is an apocalyptic number.
10123231095 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10123231095 is a deficient number, since it is larger than the sum of its proper divisors (7873624425).
10123231095 is an equidigital number, since it uses as much as digits as its factorization.
10123231095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74986911 (or 74986905 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
Adding to 10123231095 its reverse (59013232101), we get a palindrome (69136463196).
The spelling of 10123231095 in words is "ten billion, one hundred twenty-three million, two hundred thirty-one thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •