Base | Representation |
---|---|
bin | 100010001001110001010101… |
… | …001011110001000010001100 |
3 | 201200211110102110222102222021 |
4 | 202021301111023301002030 |
5 | 124141424343002023000 |
6 | 1251243122554255524 |
7 | 43431645361123015 |
oct | 4211612513610214 |
9 | 650743373872867 |
10 | 150205025423500 |
11 | 43950659018523 |
12 | 14a1a8a71275a4 |
13 | 65a7372078858 |
14 | 2913d67ada00c |
15 | 125729db7d11a |
hex | 889c552f108c |
150205025423500 has 48 divisors (see below), whose sum is σ = 328101639963552. Its totient is φ = 60072144888000.
The previous prime is 150205025423483. The next prime is 150205025423513. The reversal of 150205025423500 is 5324520502051.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21614659 + ... + 27705658.
It is an arithmetic number, because the mean of its divisors is an integer number (6835450832574).
Almost surely, 2150205025423500 is an apocalyptic number.
150205025423500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150205025423500 is an abundant number, since it is smaller than the sum of its proper divisors (177896614540052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150205025423500 is a wasteful number, since it uses less digits than its factorization.
150205025423500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49326427 (or 49326415 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 34.
Adding to 150205025423500 its reverse (5324520502051), we get a palindrome (155529545925551).
The spelling of 150205025423500 in words is "one hundred fifty trillion, two hundred five billion, twenty-five million, four hundred twenty-three thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •