Base | Representation |
---|---|
bin | 1011111010101000110101… |
… | …1100000111100000010110 |
3 | 1201101112121112011122022001 |
4 | 2332222031130013200112 |
5 | 3204130420420223110 |
6 | 43510553020025514 |
7 | 2521406230523335 |
oct | 276521534074026 |
9 | 51345545148261 |
10 | 13102023211030 |
11 | 41a159a596226 |
12 | 157731509229a |
13 | 7406916ab040 |
14 | 3341d9a63d1c |
15 | 17ac3131b63a |
hex | bea8d707816 |
13102023211030 has 64 divisors (see below), whose sum is σ = 25990743417408. Its totient is φ = 4724742597120.
The previous prime is 13102023211009. The next prime is 13102023211031. The reversal of 13102023211030 is 3011232020131.
13102023211030 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13102023210989 and 13102023211007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102023211031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65980252 + ... + 66178528.
It is an arithmetic number, because the mean of its divisors is an integer number (406105365897).
Almost surely, 213102023211030 is an apocalyptic number.
13102023211030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13102023211030 is a deficient number, since it is larger than the sum of its proper divisors (12888720206378).
13102023211030 is a wasteful number, since it uses less digits than its factorization.
13102023211030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210161.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13102023211030 its reverse (3011232020131), we get a palindrome (16113255231161).
The spelling of 13102023211030 in words is "thirteen trillion, one hundred two billion, twenty-three million, two hundred eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •