Base | Representation |
---|---|
bin | 11101111110101111111… |
… | …00011100101010010111 |
3 | 10122110220211202121220201 |
4 | 32333113330130222113 |
5 | 113334141223144343 |
6 | 2105121453241331 |
7 | 134265223433461 |
oct | 16772774345227 |
9 | 3573824677821 |
10 | 1030120131223 |
11 | 367964a60327 |
12 | 147789193247 |
13 | 761a85024b1 |
14 | 37c02803131 |
15 | 1bbe0bbe94d |
hex | efd7f1ca97 |
1030120131223 has 16 divisors (see below), whose sum is σ = 1054750092480. Its totient is φ = 1005691774464.
The previous prime is 1030120131221. The next prime is 1030120131241. The reversal of 1030120131223 is 3221310210301.
It is a cyclic number.
It is not a de Polignac number, because 1030120131223 - 21 = 1030120131221 is a prime.
It is a super-2 number, since 2×10301201312232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1030120131223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030120131221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11689615 + ... + 11777407.
It is an arithmetic number, because the mean of its divisors is an integer number (65921880780).
Almost surely, 21030120131223 is an apocalyptic number.
1030120131223 is a deficient number, since it is larger than the sum of its proper divisors (24629961257).
1030120131223 is an equidigital number, since it uses as much as digits as its factorization.
1030120131223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88938.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1030120131223 its reverse (3221310210301), we get a palindrome (4251430341524).
The spelling of 1030120131223 in words is "one trillion, thirty billion, one hundred twenty million, one hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •