Base | Representation |
---|---|
bin | 111101001000100110111… |
… | …111111111001001101001 |
3 | 112212121212010122101011111 |
4 | 331020212333333021221 |
5 | 1022312404333322213 |
6 | 12533550141430321 |
7 | 612343655356453 |
oct | 75104677771151 |
9 | 15777763571144 |
10 | 4201132323433 |
11 | 137a765745161 |
12 | 57a25a86b3a1 |
13 | 24621b8a4c76 |
14 | 10749b9752d3 |
15 | 74433a4ca3d |
hex | 3d226fff269 |
4201132323433 has 8 divisors (see below), whose sum is σ = 4223007835200. Its totient is φ = 4179262367280.
The previous prime is 4201132323397. The next prime is 4201132323491. The reversal of 4201132323433 is 3343232311024.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4201132323433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4201132323395 and 4201132323404.
It is not an unprimeable number, because it can be changed into a prime (4201132323233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131748 + ... + 2901658.
It is an arithmetic number, because the mean of its divisors is an integer number (527875979400).
Almost surely, 24201132323433 is an apocalyptic number.
It is an amenable number.
4201132323433 is a deficient number, since it is larger than the sum of its proper divisors (21875511767).
4201132323433 is a wasteful number, since it uses less digits than its factorization.
4201132323433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2777807.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 4201132323433 its reverse (3343232311024), we get a palindrome (7544364634457).
The spelling of 4201132323433 in words is "four trillion, two hundred one billion, one hundred thirty-two million, three hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •