Base | Representation |
---|---|
bin | 1000111110011110110… |
… | …1100111101101110101 |
3 | 112202001020212022221211 |
4 | 2033213231213231311 |
5 | 10011311101221123 |
6 | 154502124241421 |
7 | 14066333600500 |
oct | 2174755475565 |
9 | 482036768854 |
10 | 154211351413 |
11 | 5a445318869 |
12 | 25a790a0271 |
13 | 11707c00b82 |
14 | 766cc00137 |
15 | 40286a240d |
hex | 23e7b67b75 |
154211351413 has 12 divisors (see below), whose sum is σ = 185175449472. Its totient is φ = 127917248760.
The previous prime is 154211351383. The next prime is 154211351449. The reversal of 154211351413 is 314153112451.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-154211351413 is a prime.
It is a super-2 number, since 2×1542113514132 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (154211351453) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 50759295 + ... + 50762332.
It is an arithmetic number, because the mean of its divisors is an integer number (15431287456).
Almost surely, 2154211351413 is an apocalyptic number.
It is an amenable number.
154211351413 is a deficient number, since it is larger than the sum of its proper divisors (30964098059).
154211351413 is a wasteful number, since it uses less digits than its factorization.
154211351413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101521672 (or 101521665 counting only the distinct ones).
The product of its digits is 7200, while the sum is 31.
Adding to 154211351413 its reverse (314153112451), we get a palindrome (468364463864).
The spelling of 154211351413 in words is "one hundred fifty-four billion, two hundred eleven million, three hundred fifty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •