Base | Representation |
---|---|
bin | 1101010100111100101… |
… | …0000001001011001001 |
3 | 210212222201001210201221 |
4 | 3111033022001023021 |
5 | 12222403042334001 |
6 | 253103335042041 |
7 | 22353605610400 |
oct | 3251712011311 |
9 | 725881053657 |
10 | 228961293001 |
11 | 891137542a1 |
12 | 3845a810321 |
13 | 1878b443c3c |
14 | b1205c4637 |
15 | 5e50cc31a1 |
hex | 354f2812c9 |
228961293001 has 27 divisors (see below), whose sum is σ = 283001930037. Its totient is φ = 184662334080.
The previous prime is 228961292983. The next prime is 228961293023. The reversal of 228961293001 is 100392169822.
The square root of 228961293001 is 478499.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 13364516025 + 215596776976 = 115605^2 + 464324^2 .
It is not a de Polignac number, because 228961293001 - 25 = 228961292969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (228961213001) 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 26 ways as a sum of consecutive naturals, for example, 56939371 + ... + 56943391.
Almost surely, 2228961293001 is an apocalyptic number.
228961293001 is the 478499-th square number.
228961293001 is the 239250-th centered octagonal number.
It is an amenable number.
228961293001 is a deficient number, since it is larger than the sum of its proper divisors (54040637036).
228961293001 is an frugal number, since it uses more digits than its factorization.
228961293001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8090 (or 4045 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 43.
The spelling of 228961293001 in words is "two hundred twenty-eight billion, nine hundred sixty-one million, two hundred ninety-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •