Base | Representation |
---|---|
bin | 11101110010010000010… |
… | …11111011100010001001 |
3 | 10121211121102200110210110 |
4 | 32321020023323202021 |
5 | 113231422301202213 |
6 | 2102052150504533 |
7 | 133640064355623 |
oct | 16711013734211 |
9 | 3554542613713 |
10 | 1023413303433 |
11 | 365033147344 |
12 | 146417065149 |
13 | 75679b76641 |
14 | 37767b9dc13 |
15 | 1b94beb65c3 |
hex | ee482fb889 |
1023413303433 has 16 divisors (see below), whose sum is σ = 1383342289280. Its totient is φ = 672881261184.
The previous prime is 1023413303431. The next prime is 1023413303441. The reversal of 1023413303433 is 3343033143201.
1023413303433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1023413303433 - 21 = 1023413303431 is a prime.
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 1023413303433.
It is not an unprimeable number, because it can be changed into a prime (1023413303431) 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, 3049548 + ... + 3368466.
It is an arithmetic number, because the mean of its divisors is an integer number (86458893080).
Almost surely, 21023413303433 is an apocalyptic number.
It is an amenable number.
1023413303433 is a deficient number, since it is larger than the sum of its proper divisors (359928985847).
1023413303433 is a wasteful number, since it uses less digits than its factorization.
1023413303433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333648.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 1023413303433 its reverse (3343033143201), we get a palindrome (4366446446634).
The spelling of 1023413303433 in words is "one trillion, twenty-three billion, four hundred thirteen million, three hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •