Base | Representation |
---|---|
bin | 1011110110100111110000… |
… | …1000001100111100100110 |
3 | 1201010221111002211222120110 |
4 | 2331221330020030330212 |
5 | 3202013102401113110 |
6 | 43415141134113450 |
7 | 2513414135131422 |
oct | 275517410147446 |
9 | 51127432758513 |
10 | 13033013301030 |
11 | 41752a7269458 |
12 | 1565a7594b886 |
13 | 737014410c78 |
14 | 330b30739b82 |
15 | 179042ad0a20 |
hex | bda7c20cf26 |
13033013301030 has 32 divisors (see below), whose sum is σ = 31316963263200. Its totient is φ = 3471277842432.
The previous prime is 13033013301023. The next prime is 13033013301103. The reversal of 13033013301030 is 3010331033031.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13033013300988 and 13033013301006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 261997915 + ... + 262047654.
It is an arithmetic number, because the mean of its divisors is an integer number (978655101975).
Almost surely, 213033013301030 is an apocalyptic number.
13033013301030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13033013301030 is an abundant number, since it is smaller than the sum of its proper divisors (18283949962170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13033013301030 is a wasteful number, since it uses less digits than its factorization.
13033013301030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524046408.
The product of its (nonzero) digits is 729, while the sum is 21.
Adding to 13033013301030 its reverse (3010331033031), we get a palindrome (16043344334061).
The spelling of 13033013301030 in words is "thirteen trillion, thirty-three billion, thirteen million, three hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •