Base | Representation |
---|---|
bin | 1000011110000101010… |
… | …1001010001101111110 |
3 | 111220121010220102212011 |
4 | 2013201111022031332 |
5 | 4341003132404441 |
6 | 150503125201434 |
7 | 13340660330641 |
oct | 2074125121576 |
9 | 456533812764 |
10 | 145514341246 |
11 | 5679206335a |
12 | 2425056027a |
13 | 10950157501 |
14 | 7085b39a58 |
15 | 3bb9dc5581 |
hex | 21e154a37e |
145514341246 has 4 divisors (see below), whose sum is σ = 218271511872. Its totient is φ = 72757170622.
The previous prime is 145514341237. The next prime is 145514341283. The reversal of 145514341246 is 642143415541.
145514341246 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 642143415541 = 449 ⋅1430163509.
It is a junction number, because it is equal to n+sod(n) for n = 145514341199 and 145514341208.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 36378585310 + ... + 36378585313.
It is an arithmetic number, because the mean of its divisors is an integer number (54567877968).
Almost surely, 2145514341246 is an apocalyptic number.
145514341246 is a deficient number, since it is larger than the sum of its proper divisors (72757170626).
145514341246 is an equidigital number, since it uses as much as digits as its factorization.
145514341246 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72757170625.
The product of its digits is 230400, while the sum is 40.
Adding to 145514341246 its reverse (642143415541), we get a palindrome (787657756787).
The spelling of 145514341246 in words is "one hundred forty-five billion, five hundred fourteen million, three hundred forty-one thousand, two hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •