Base | Representation |
---|---|
bin | 111100110101001001… |
… | …0011011101111111111 |
3 | 110111011222121011102010 |
4 | 1321222102123233333 |
5 | 4120013323023111 |
6 | 140002302102303 |
7 | 12303121454043 |
oct | 1715222335777 |
9 | 414158534363 |
10 | 130632236031 |
11 | 50445545450 |
12 | 2139857a993 |
13 | c41ab790ab |
14 | 6473444023 |
15 | 35e85ecaa6 |
hex | 1e6a49bbff |
130632236031 has 32 divisors (see below), whose sum is σ = 191773112832. Its totient is φ = 78437237760.
The previous prime is 130632235999. The next prime is 130632236083.
130632236031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 130632236031 - 25 = 130632235999 is a prime.
It is a super-2 number, since 2×1306322360312 (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 130632236031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130632236531) 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, 11005806 + ... + 11017668.
It is an arithmetic number, because the mean of its divisors is an integer number (5992909776).
Almost surely, 2130632236031 is an apocalyptic number.
130632236031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130632236031 is a deficient number, since it is larger than the sum of its proper divisors (61140876801).
130632236031 is a wasteful number, since it uses less digits than its factorization.
130632236031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14943.
The product of its (nonzero) digits is 11664, while the sum is 30.
It can be divided in two parts, 130632 and 236031, that added together give a palindrome (366663).
The spelling of 130632236031 in words is "one hundred thirty billion, six hundred thirty-two million, two hundred thirty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •