Base | Representation |
---|---|
bin | 1000011110000011010… |
… | …1111010111001101110 |
3 | 111220120120111101101110 |
4 | 2013200311322321232 |
5 | 4340444033331141 |
6 | 150502233452450 |
7 | 13340530612503 |
oct | 2074065727156 |
9 | 456516441343 |
10 | 145506152046 |
11 | 5678847a722 |
12 | 24249871126 |
13 | 1094b54ac28 |
14 | 7084a074aa |
15 | 3bb9308e16 |
hex | 21e0d7ae6e |
145506152046 has 8 divisors (see below), whose sum is σ = 291012304104. Its totient is φ = 48502050680.
The previous prime is 145506152041. The next prime is 145506152069. The reversal of 145506152046 is 640251605541.
It is a sphenic number, since it is the product of 3 distinct primes.
145506152046 is an admirable number.
It is a super-2 number, since 2×1455061520462 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145506151995 and 145506152013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145506152041) 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, 12125512665 + ... + 12125512676.
It is an arithmetic number, because the mean of its divisors is an integer number (36376538013).
Almost surely, 2145506152046 is an apocalyptic number.
145506152046 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145506152046 is a wasteful number, since it uses less digits than its factorization.
145506152046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24251025346.
The product of its (nonzero) digits is 144000, while the sum is 39.
Adding to 145506152046 its reverse (640251605541), we get a palindrome (785757757587).
The spelling of 145506152046 in words is "one hundred forty-five billion, five hundred six million, one hundred fifty-two thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •