Base | Representation |
---|---|
bin | 1000110000010010110… |
… | …0010100010111111101 |
3 | 112101012210222210120111 |
4 | 2030010230110113331 |
5 | 4431011030111023 |
6 | 153032145150021 |
7 | 13603054565515 |
oct | 2140454242775 |
9 | 471183883514 |
10 | 150402582013 |
11 | 58870377a62 |
12 | 2519562b311 |
13 | 1124bab6078 |
14 | 73cb028845 |
15 | 3da410300d |
hex | 2304b145fd |
150402582013 has 8 divisors (see below), whose sum is σ = 155834490168. Its totient is φ = 145042619904.
The previous prime is 150402581971. The next prime is 150402582037. The reversal of 150402582013 is 310285204051.
It can be written as a sum of positive squares in 4 ways, for example, as 1577916729 + 148824665284 = 39723^2 + 385778^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 150402582013 - 29 = 150402581501 is a prime.
It is a super-2 number, since 2×1504025820132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150402582613) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17982256 + ... + 17990617.
It is an arithmetic number, because the mean of its divisors is an integer number (19479311271).
Almost surely, 2150402582013 is an apocalyptic number.
It is an amenable number.
150402582013 is a deficient number, since it is larger than the sum of its proper divisors (5431908155).
150402582013 is a wasteful number, since it uses less digits than its factorization.
150402582013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35973023.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 150402582013 its reverse (310285204051), we get a palindrome (460687786064).
The spelling of 150402582013 in words is "one hundred fifty billion, four hundred two million, five hundred eighty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •