Base | Representation |
---|---|
bin | 110101100110101000… |
… | …0010111110010101010 |
3 | 102000010101222122021222 |
4 | 1223031100113302222 |
5 | 3341222332130410 |
6 | 124514310102042 |
7 | 11213413256366 |
oct | 1531520276252 |
9 | 360111878258 |
10 | 115112770730 |
11 | 44901181471 |
12 | 1a38704a922 |
13 | ab16821029 |
14 | 580023c2a6 |
15 | 2edadc7955 |
hex | 1acd417caa |
115112770730 has 32 divisors (see below), whose sum is σ = 211513068288. Its totient is φ = 45095904000.
The previous prime is 115112770727. The next prime is 115112770733. The reversal of 115112770730 is 37077211511.
It is an interprime number because it is at equal distance from previous prime (115112770727) and next prime (115112770733).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (115112770733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 429647 + ... + 644066.
It is an arithmetic number, because the mean of its divisors is an integer number (6609783384).
Almost surely, 2115112770730 is an apocalyptic number.
115112770730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115112770730 is a deficient number, since it is larger than the sum of its proper divisors (96400297558).
115112770730 is a wasteful number, since it uses less digits than its factorization.
115112770730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073942.
The product of its (nonzero) digits is 10290, while the sum is 35.
The spelling of 115112770730 in words is "one hundred fifteen billion, one hundred twelve million, seven hundred seventy thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •