Base | Representation |
---|---|
bin | 11100001011001101… |
… | …01101111011101110 |
3 | 1110001012000211000100 |
4 | 32011212231323232 |
5 | 221434330434410 |
6 | 10540551411530 |
7 | 1043563313304 |
oct | 160546557356 |
9 | 43035024010 |
10 | 15126421230 |
11 | 646251a178 |
12 | 2b21983ba6 |
13 | 1570ab090b |
14 | a36d32274 |
15 | 5d7e878c0 |
hex | 3859adeee |
15126421230 has 48 divisors (see below), whose sum is σ = 39414860784. Its totient is φ = 4024874880.
The previous prime is 15126421229. The next prime is 15126421241. The reversal of 15126421230 is 3212462151.
15126421230 is a `hidden beast` number, since 1 + 5 + 1 + 2 + 6 + 421 + 230 = 666.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 15126421194 and 15126421203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 142756 + ... + 225015.
It is an arithmetic number, because the mean of its divisors is an integer number (821142933).
Almost surely, 215126421230 is an apocalyptic number.
15126421230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15126421230 is an abundant number, since it is smaller than the sum of its proper divisors (24288439554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15126421230 is a wasteful number, since it uses less digits than its factorization.
15126421230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368241 (or 368238 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 15126421230 its reverse (3212462151), we get a palindrome (18338883381).
The spelling of 15126421230 in words is "fifteen billion, one hundred twenty-six million, four hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •