Base | Representation |
---|---|
bin | 100010001010000010000101… |
… | …110011100001010010010110 |
3 | 201200220011212121212110221211 |
4 | 202022002011303201102112 |
5 | 124142223221340122220 |
6 | 1251255300402332034 |
7 | 43433153334145600 |
oct | 4212020563412226 |
9 | 650804777773854 |
10 | 150223021020310 |
11 | 43958253072787 |
12 | 14a2228995a01a |
13 | 65a8c7c3c6ba4 |
14 | 2914b93adc170 |
15 | 12579a3966b5a |
hex | 88a085ce1496 |
150223021020310 has 24 divisors (see below), whose sum is σ = 314548611361920. Its totient is φ = 51505035778224.
The previous prime is 150223021020269. The next prime is 150223021020329. The reversal of 150223021020310 is 13020120322051.
It is a super-2 number, since 2×1502230210203102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 153288796470 + ... + 153288797449.
It is an arithmetic number, because the mean of its divisors is an integer number (13106192140080).
Almost surely, 2150223021020310 is an apocalyptic number.
150223021020310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150223021020310 is an abundant number, since it is smaller than the sum of its proper divisors (164325590341610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150223021020310 is a wasteful number, since it uses less digits than its factorization.
150223021020310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306577593940 (or 306577593933 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 150223021020310 its reverse (13020120322051), we get a palindrome (163243141342361).
The spelling of 150223021020310 in words is "one hundred fifty trillion, two hundred twenty-three billion, twenty-one million, twenty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •