Base | Representation |
---|---|
bin | 11100010111100101… |
… | …11000110101101001 |
3 | 1110022102110010111100 |
4 | 32023302320311221 |
5 | 222142422244141 |
6 | 10555141352013 |
7 | 1046264125611 |
oct | 161362706551 |
9 | 43272403440 |
10 | 15230274921 |
11 | 6506102a74 |
12 | 2b50708609 |
13 | 15894734c4 |
14 | a46a47a41 |
15 | 5e214e0b6 |
hex | 38bcb8d69 |
15230274921 has 27 divisors (see below), whose sum is σ = 22748975613. Its totient is φ = 9818579160.
The previous prime is 15230274911. The next prime is 15230274947. The reversal of 15230274921 is 12947203251.
The square root of 15230274921 is 123411.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 15230274921 - 25 = 15230274889 is a prime.
It is a super-2 number, since 2×152302749212 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (15230274911) 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 26 ways as a sum of consecutive naturals, for example, 11476560 + ... + 11477886.
Almost surely, 215230274921 is an apocalyptic number.
15230274921 is the 123411-st square number.
15230274921 is the 61706-th centered octagonal number.
It is an amenable number.
15230274921 is a deficient number, since it is larger than the sum of its proper divisors (7518700692).
15230274921 is an frugal number, since it uses more digits than its factorization.
15230274921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2722 (or 1361 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
Multiplying 15230274921 by its sum of digits (36), we get a square (548289897156 = 7404662).
The spelling of 15230274921 in words is "fifteen billion, two hundred thirty million, two hundred seventy-four thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •