Base | Representation |
---|---|
bin | 1000011101101011011… |
… | …0110001001111100011 |
3 | 111220022120111110121222 |
4 | 2013122312301033203 |
5 | 4340242330230311 |
6 | 150444245005255 |
7 | 13335201103436 |
oct | 2073266611743 |
9 | 456276443558 |
10 | 145405711331 |
11 | 56736808071 |
12 | 242200b382b |
13 | 109337b195a |
14 | 707553d81d |
15 | 3bb05b8adb |
hex | 21dadb13e3 |
145405711331 has 4 divisors (see below), whose sum is σ = 145499948592. Its totient is φ = 145311474072.
The previous prime is 145405711313. The next prime is 145405711337. The reversal of 145405711331 is 133117504541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145405711331 is a prime.
It is a super-2 number, since 2×1454057113312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145405711291 and 145405711300.
It is not an unprimeable number, because it can be changed into a prime (145405711337) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47116316 + ... + 47119401.
It is an arithmetic number, because the mean of its divisors is an integer number (36374987148).
Almost surely, 2145405711331 is an apocalyptic number.
145405711331 is a deficient number, since it is larger than the sum of its proper divisors (94237261).
145405711331 is an equidigital number, since it uses as much as digits as its factorization.
145405711331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94237260.
The product of its (nonzero) digits is 25200, while the sum is 35.
The spelling of 145405711331 in words is "one hundred forty-five billion, four hundred five million, seven hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •