Base | Representation |
---|---|
bin | 10101011110011000… |
… | …000011001011010011 |
3 | 2012111222001212221200 |
4 | 111132120003023103 |
5 | 334210344334001 |
6 | 14332013122243 |
7 | 1444255313463 |
oct | 253630031323 |
9 | 65458055850 |
10 | 23058199251 |
11 | 986283041a |
12 | 4576189383 |
13 | 22361585a9 |
14 | 118a51bba3 |
15 | 8ee4a9086 |
hex | 55e6032d3 |
23058199251 has 12 divisors (see below), whose sum is σ = 34454780880. Its totient is φ = 14842059120.
The previous prime is 23058199211. The next prime is 23058199261. The reversal of 23058199251 is 15299185032.
23058199251 is a `hidden beast` number, since 2 + 305 + 8 + 1 + 99 + 251 = 666.
It is not a de Polignac number, because 23058199251 - 222 = 23054004947 is a prime.
It is a super-3 number, since 3×230581992513 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 23058199197 and 23058199206.
It is not an unprimeable number, because it can be changed into a prime (23058199211) 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 11 ways as a sum of consecutive naturals, for example, 44172535 + ... + 44173056.
It is an arithmetic number, because the mean of its divisors is an integer number (2871231740).
Almost surely, 223058199251 is an apocalyptic number.
23058199251 is a deficient number, since it is larger than the sum of its proper divisors (11396581629).
23058199251 is a wasteful number, since it uses less digits than its factorization.
23058199251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88345626 (or 88345623 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 45.
The spelling of 23058199251 in words is "twenty-three billion, fifty-eight million, one hundred ninety-nine thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •