Base | Representation |
---|---|
bin | 110000011101010111100000… |
… | …101001010100011110111010 |
3 | 1000221121111011202220002120202 |
4 | 300131113200221110132322 |
5 | 210413312122311414002 |
6 | 2033135545355522202 |
7 | 62614503565231001 |
oct | 6035274051243672 |
9 | 1027544152802522 |
10 | 213124341123002 |
11 | 619a9586473121 |
12 | 1baa0b12759362 |
13 | 91bc70161b89a |
14 | 3a8b3b7741c38 |
15 | 1998cbe885502 |
hex | c1d5e0a547ba |
213124341123002 has 16 divisors (see below), whose sum is σ = 330710643390600. Its totient is φ = 102887470190400.
The previous prime is 213124341122983. The next prime is 213124341123019. The reversal of 213124341123002 is 200321143421312.
It is a happy number.
213124341123002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 190293996394681 + 22830344728321 = 13794709^2 + 4778111^2 .
It is a super-2 number, since 2×2131243411230022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48267752 + ... + 52497852.
Almost surely, 2213124341123002 is an apocalyptic number.
213124341123002 is a deficient number, since it is larger than the sum of its proper divisors (117586302267598).
213124341123002 is a wasteful number, since it uses less digits than its factorization.
213124341123002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5098801.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 213124341123002 its reverse (200321143421312), we get a palindrome (413445484544314).
The spelling of 213124341123002 in words is "two hundred thirteen trillion, one hundred twenty-four billion, three hundred forty-one million, one hundred twenty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •