Base | Representation |
---|---|
bin | 101010000010000001… |
… | …011111010010010011 |
3 | 11022111021010111021112 |
4 | 222002001133102103 |
5 | 1214412030220311 |
6 | 32422152043535 |
7 | 3155251013621 |
oct | 520201372223 |
9 | 138437114245 |
10 | 45131101331 |
11 | 1815a36a458 |
12 | 88b63935ab |
13 | 4343123cb4 |
14 | 2281c38511 |
15 | 12921d828b |
hex | a8205f493 |
45131101331 has 8 divisors (see below), whose sum is σ = 47095452960. Its totient is φ = 43166927232.
The previous prime is 45131101313. The next prime is 45131101333. The reversal of 45131101331 is 13310113154.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 45131101331 - 210 = 45131100307 is a prime.
It is a super-2 number, since 2×451311013312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45131101297 and 45131101306.
It is not an unprimeable number, because it can be changed into a prime (45131101333) 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, 938141 + ... + 985073.
It is an arithmetic number, because the mean of its divisors is an integer number (5886931620).
Almost surely, 245131101331 is an apocalyptic number.
45131101331 is a deficient number, since it is larger than the sum of its proper divisors (1964351629).
45131101331 is a wasteful number, since it uses less digits than its factorization.
45131101331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88765.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 45131101331 its reverse (13310113154), we get a palindrome (58441214485).
The spelling of 45131101331 in words is "forty-five billion, one hundred thirty-one million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.265 sec. • engine limits •