Base | Representation |
---|---|
bin | 1000110111110000000… |
… | …0101001100101110111 |
3 | 112120101022202201022001 |
4 | 2031330000221211313 |
5 | 4444111011304003 |
6 | 154002535120131 |
7 | 14003503013155 |
oct | 2157400514567 |
9 | 476338681261 |
10 | 152404400503 |
11 | 596a8346903 |
12 | 25653b13047 |
13 | 114aa749054 |
14 | 753ac383d5 |
15 | 3e6ec2461d |
hex | 237c029977 |
152404400503 has 8 divisors (see below), whose sum is σ = 160644561200. Its totient is φ = 144186127488.
The previous prime is 152404400497. The next prime is 152404400513. The reversal of 152404400503 is 305004404251.
152404400503 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 152404400503 - 217 = 152404269431 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152404400513) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5457618 + ... + 5485471.
It is an arithmetic number, because the mean of its divisors is an integer number (20080570150).
Almost surely, 2152404400503 is an apocalyptic number.
152404400503 is a deficient number, since it is larger than the sum of its proper divisors (8240160697).
152404400503 is a wasteful number, since it uses less digits than its factorization.
152404400503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10943841.
The product of its (nonzero) digits is 9600, while the sum is 28.
Adding to 152404400503 its reverse (305004404251), we get a palindrome (457408804754).
The spelling of 152404400503 in words is "one hundred fifty-two billion, four hundred four million, four hundred thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •