Base | Representation |
---|---|
bin | 111010010000110010111… |
… | …110101000111010111101 |
3 | 112011202102020211102022010 |
4 | 322100302332220322331 |
5 | 1011044202242114323 |
6 | 12303145410441433 |
7 | 562156011202002 |
oct | 72206276507275 |
9 | 15152366742263 |
10 | 4003764801213 |
11 | 1303a94941531 |
12 | 547b58893279 |
13 | 230726a8a768 |
14 | dbad734b8a9 |
15 | 6e231771c93 |
hex | 3a432fa8ebd |
4003764801213 has 4 divisors (see below), whose sum is σ = 5338353068288. Its totient is φ = 2669176534140.
The previous prime is 4003764801151. The next prime is 4003764801221. The reversal of 4003764801213 is 3121084673004.
4003764801213 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 4003764801213 - 224 = 4003748023997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4003764801263) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 667294133533 + ... + 667294133538.
It is an arithmetic number, because the mean of its divisors is an integer number (1334588267072).
Almost surely, 24003764801213 is an apocalyptic number.
It is an amenable number.
4003764801213 is a deficient number, since it is larger than the sum of its proper divisors (1334588267075).
4003764801213 is a wasteful number, since it uses less digits than its factorization.
4003764801213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1334588267074.
The product of its (nonzero) digits is 96768, while the sum is 39.
The spelling of 4003764801213 in words is "four trillion, three billion, seven hundred sixty-four million, eight hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •