Base | Representation |
---|---|
bin | 1000101111111111100… |
… | …1101111000101100100 |
3 | 112101000012202122022112 |
4 | 2023333321233011210 |
5 | 4430324441310340 |
6 | 153020154420152 |
7 | 13601060505254 |
oct | 2137771570544 |
9 | 471005678275 |
10 | 150322213220 |
11 | 58829a74773 |
12 | 25172731658 |
13 | 11238256b7a |
14 | 73c04a7964 |
15 | 3d9c02a065 |
hex | 22ffe6f164 |
150322213220 has 12 divisors (see below), whose sum is σ = 315676647804. Its totient is φ = 60128885280.
The previous prime is 150322213219. The next prime is 150322213259. The reversal of 150322213220 is 22312223051.
It can be written as a sum of positive squares in 2 ways, for example, as 21090591076 + 129231622144 = 145226^2 + 359488^2 .
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 3758055311 + ... + 3758055350.
It is an arithmetic number, because the mean of its divisors is an integer number (26306387317).
Almost surely, 2150322213220 is an apocalyptic number.
150322213220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150322213220 is an abundant number, since it is smaller than the sum of its proper divisors (165354434584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150322213220 is a wasteful number, since it uses less digits than its factorization.
150322213220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7516110670 (or 7516110668 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 150322213220 its reverse (22312223051), we get a palindrome (172634436271).
The spelling of 150322213220 in words is "one hundred fifty billion, three hundred twenty-two million, two hundred thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •