Base | Representation |
---|---|
bin | 11101111111000100100… |
… | …10011101001111110110 |
3 | 10122111100221022110102002 |
4 | 32333202102131033312 |
5 | 113340020140013300 |
6 | 2105151013015302 |
7 | 134302431503153 |
oct | 16774222351766 |
9 | 3574327273362 |
10 | 1030293672950 |
11 | 367a43a11843 |
12 | 147817324532 |
13 | 762054548c9 |
14 | 37c1b89922a |
15 | 1bc0104e5d5 |
hex | efe249d3f6 |
1030293672950 has 12 divisors (see below), whose sum is σ = 1916346231780. Its totient is φ = 412117469160.
The previous prime is 1030293672949. The next prime is 1030293672959. The reversal of 1030293672950 is 592763920301.
It is a junction number, because it is equal to n+sod(n) for n = 1030293672895 and 1030293672904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030293672959) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10302936680 + ... + 10302936779.
It is an arithmetic number, because the mean of its divisors is an integer number (159695519315).
Almost surely, 21030293672950 is an apocalyptic number.
1030293672950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030293672950 is a deficient number, since it is larger than the sum of its proper divisors (886052558830).
1030293672950 is a wasteful number, since it uses less digits than its factorization.
1030293672950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20605873471 (or 20605873466 counting only the distinct ones).
The product of its (nonzero) digits is 612360, while the sum is 47.
The spelling of 1030293672950 in words is "one trillion, thirty billion, two hundred ninety-three million, six hundred seventy-two thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •