Base | Representation |
---|---|
bin | 11101111110101111111… |
… | …00110010011000110101 |
3 | 10122110220211221010222122 |
4 | 32333113330302120311 |
5 | 113334141234021323 |
6 | 2105121455205325 |
7 | 134265224254100 |
oct | 16772774623065 |
9 | 3573824833878 |
10 | 1030120220213 |
11 | 367965011177 |
12 | 147789216845 |
13 | 761a8533b56 |
14 | 37c02827737 |
15 | 1bbe0bdaec8 |
hex | efd7f32635 |
1030120220213 has 48 divisors (see below), whose sum is σ = 1266954923520. Its totient is φ = 833794819200.
The previous prime is 1030120220197. The next prime is 1030120220219. The reversal of 1030120220213 is 3120220210301.
It is not a de Polignac number, because 1030120220213 - 24 = 1030120220197 is a prime.
It is a super-2 number, since 2×10301202202132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030120220191 and 1030120220200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030120220219) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 72429443 + ... + 72443663.
It is an arithmetic number, because the mean of its divisors is an integer number (26394894240).
Almost surely, 21030120220213 is an apocalyptic number.
It is an amenable number.
1030120220213 is a deficient number, since it is larger than the sum of its proper divisors (236834703307).
1030120220213 is a wasteful number, since it uses less digits than its factorization.
1030120220213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15418 (or 15411 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1030120220213 its reverse (3120220210301), we get a palindrome (4150340430514).
The spelling of 1030120220213 in words is "one trillion, thirty billion, one hundred twenty million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •