Base | Representation |
---|---|
bin | 1001111000011001… |
… | …11110010100000111 |
3 | 111200201021222120210 |
4 | 10330030332110013 |
5 | 41331040014343 |
6 | 2234224330503 |
7 | 245314523604 |
oct | 47414762407 |
9 | 14621258523 |
10 | 5305001223 |
11 | 2282597a35 |
12 | 1040773a33 |
13 | 6670baba2 |
14 | 3847b76ab |
15 | 210b02333 |
hex | 13c33e507 |
5305001223 has 8 divisors (see below), whose sum is σ = 7074249328. Its totient is φ = 3536210304.
The previous prime is 5305001209. The next prime is 5305001243. The reversal of 5305001223 is 3221005035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5305001223 - 26 = 5305001159 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5305001223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5305001243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86236 + ... + 134337.
It is an arithmetic number, because the mean of its divisors is an integer number (884281166).
Almost surely, 25305001223 is an apocalyptic number.
5305001223 is a deficient number, since it is larger than the sum of its proper divisors (1769248105).
5305001223 is a wasteful number, since it uses less digits than its factorization.
5305001223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228593.
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 5305001223 is about 72835.4393341593. The cubic root of 5305001223 is about 1744.0616376202.
Adding to 5305001223 its reverse (3221005035), we get a palindrome (8526006258).
The spelling of 5305001223 in words is "five billion, three hundred five million, one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •