Base | Representation |
---|---|
bin | 111101001010100011101… |
… | …000000110100000110011 |
3 | 112212211020212000121222201 |
4 | 331022203220012200303 |
5 | 1022331200120323011 |
6 | 12534533432444031 |
7 | 612446534553634 |
oct | 75124350064063 |
9 | 15784225017881 |
10 | 4203223214131 |
11 | 1380638a212a7 |
12 | 57a742b49617 |
13 | 246492b237b6 |
14 | 10761952d88b |
15 | 745073b5cc1 |
hex | 3d2a3a06833 |
4203223214131 has 48 divisors (see below), whose sum is σ = 4468578966880. Its totient is φ = 3952912803840.
The previous prime is 4203223214119. The next prime is 4203223214147. The reversal of 4203223214131 is 1314123223024.
It is not a de Polignac number, because 4203223214131 - 215 = 4203223181363 is a prime.
It is a super-2 number, since 2×42032232141312 (a number of 26 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 4203223214131.
It is not an unprimeable number, because it can be changed into a prime (4203223214101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6245502211 + ... + 6245502883.
Almost surely, 24203223214131 is an apocalyptic number.
4203223214131 is a deficient number, since it is larger than the sum of its proper divisors (265355752749).
4203223214131 is a wasteful number, since it uses less digits than its factorization.
4203223214131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1556 (or 1533 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 4203223214131 its reverse (1314123223024), we get a palindrome (5517346437155).
The spelling of 4203223214131 in words is "four trillion, two hundred three billion, two hundred twenty-three million, two hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •