Base | Representation |
---|---|
bin | 100011011110010101001110… |
… | …0100001101011110001010011 |
3 | 1111220210222010120220201202102 |
4 | 1012330222130201223301103 |
5 | 311344313014013131011 |
6 | 3023345304424111015 |
7 | 122503365563224451 |
oct | 10674523441536123 |
9 | 1456728116821672 |
10 | 312032000130131 |
11 | 90472034463766 |
12 | 2abb5a8560546b |
13 | 1051565067b138 |
14 | 570a60234d9d1 |
15 | 2611a05c9473b |
hex | 11bca9c86bc53 |
312032000130131 has 8 divisors (see below), whose sum is σ = 323427262126080. Its totient is φ = 300834916603848.
The previous prime is 312032000130119. The next prime is 312032000130133. The reversal of 312032000130131 is 131031000230213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312032000130131 is a prime.
It is a super-2 number, since 2×3120320001301312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312032000130133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49544614211 + ... + 49544620508.
It is an arithmetic number, because the mean of its divisors is an integer number (40428407765760).
Almost surely, 2312032000130131 is an apocalyptic number.
312032000130131 is a deficient number, since it is larger than the sum of its proper divisors (11395261995949).
312032000130131 is an equidigital number, since it uses as much as digits as its factorization.
312032000130131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99089234833.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 312032000130131 its reverse (131031000230213), we get a palindrome (443063000360344).
The spelling of 312032000130131 in words is "three hundred twelve trillion, thirty-two billion, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •