Base | Representation |
---|---|
bin | 111101001111111111… |
… | …0101100010000110110 |
3 | 110120111202121021001112 |
4 | 1322133332230100312 |
5 | 4123334423433304 |
6 | 140231521155022 |
7 | 12334340211620 |
oct | 1723776542066 |
9 | 416452537045 |
10 | 131533030454 |
11 | 50867a6a651 |
12 | 215aa18ba72 |
13 | c532690247 |
14 | 651ad29c10 |
15 | 364c734b6e |
hex | 1e9ffac436 |
131533030454 has 32 divisors (see below), whose sum is σ = 231016968000. Its totient is φ = 54988738560.
The previous prime is 131533030397. The next prime is 131533030459. The reversal of 131533030454 is 454030335131.
It is a super-2 number, since 2×1315330304542 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131533030454.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131533030459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6274262 + ... + 6295190.
It is an arithmetic number, because the mean of its divisors is an integer number (7219280250).
Almost surely, 2131533030454 is an apocalyptic number.
131533030454 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
131533030454 is a deficient number, since it is larger than the sum of its proper divisors (99483937546).
131533030454 is a wasteful number, since it uses less digits than its factorization.
131533030454 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31928.
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 131533030454 its reverse (454030335131), we get a palindrome (585563365585).
The spelling of 131533030454 in words is "one hundred thirty-one billion, five hundred thirty-three million, thirty thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •