Base | Representation |
---|---|
bin | 11100101101011001… |
… | …10001001110000110 |
3 | 1110210011200201021112 |
4 | 32112230301032012 |
5 | 223031241021410 |
6 | 11025234445022 |
7 | 1053645132062 |
oct | 162654611606 |
9 | 43704621245 |
10 | 15413220230 |
11 | 659a3a7541 |
12 | 2ba1a33772 |
13 | 15b8338b75 |
14 | a6306aaa2 |
15 | 60323a105 |
hex | 396b31386 |
15413220230 has 16 divisors (see below), whose sum is σ = 28950048864. Its totient is φ = 5897232000.
The previous prime is 15413220217. The next prime is 15413220271. The reversal of 15413220230 is 3202231451.
15413220230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 15413220196 and 15413220205.
It is a congruent number.
It is an unprimeable number.
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, 33506771 + ... + 33507230.
It is an arithmetic number, because the mean of its divisors is an integer number (1809378054).
Almost surely, 215413220230 is an apocalyptic number.
15413220230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15413220230 is a deficient number, since it is larger than the sum of its proper divisors (13536828634).
15413220230 is a wasteful number, since it uses less digits than its factorization.
15413220230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67014031.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 15413220230 its reverse (3202231451), we get a palindrome (18615451681).
The spelling of 15413220230 in words is "fifteen billion, four hundred thirteen million, two hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •