Base | Representation |
---|---|
bin | 110100101000111101… |
… | …0000110000011001001 |
3 | 101210210011222022212000 |
4 | 1221101322012003021 |
5 | 3323003043131241 |
6 | 123533102541213 |
7 | 11111214323232 |
oct | 1512172060311 |
9 | 353704868760 |
10 | 113043333321 |
11 | 43a3a018516 |
12 | 19aa9b97809 |
13 | a876b74259 |
14 | 568546a089 |
15 | 2e1939aeb6 |
hex | 1a51e860c9 |
113043333321 has 16 divisors (see below), whose sum is σ = 167477046720. Its totient is φ = 75359773440.
The previous prime is 113043333317. The next prime is 113043333323. The reversal of 113043333321 is 123333340311.
113043333321 is a `hidden beast` number, since 1 + 1 + 3 + 0 + 4 + 3 + 333 + 321 = 666.
It is not a de Polignac number, because 113043333321 - 22 = 113043333317 is a prime.
It is a super-3 number, since 3×1130433333213 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (113043333323) 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, 1225606 + ... + 1314608.
It is an arithmetic number, because the mean of its divisors is an integer number (10467315420).
Almost surely, 2113043333321 is an apocalyptic number.
It is an amenable number.
113043333321 is a deficient number, since it is larger than the sum of its proper divisors (54433713399).
113043333321 is an equidigital number, since it uses as much as digits as its factorization.
113043333321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136053 (or 136047 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 113043333321 its reverse (123333340311), we get a palindrome (236376673632).
The spelling of 113043333321 in words is "one hundred thirteen billion, forty-three million, three hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •